I have some problems about AVL tree...Please help me....

I'm learning about AVL tree, and I have a question.....
When you want to convert from AVL to Binary Search Tree, it is whether you can have more than 2 nodes that are not valid...Ex:
I have a list that is:
1 6 9 17 25 32 64 55 78 43 48
I will input this list into a Binary search Tree, and convert it to AVL tree...
I want to ask whether I can do this...

Code:

        "1" --   ->        "6"/   ->         "6" --               ->             "6"\                             ->
                         "1" --              "1"--    "9"--                    "1"--      "9"\
                                                                                                          "17"--


                      "6"\\                                     ->             "6"\                      OR             "9"-- 
                "1"--       "9"\\                                      "1"--         "17"--                   "6"/      "17"\ 
                                      "17"\                                        "9"--     "25"--         "1"--          "25"-- 
                                              "25"-- 

OR when I have 
                "9"\                                                 "9"\\ 
         "6"/       "25"\                         ->      "6"/       "25"\\                     ->
    "1"--     "17"--    "32"\                       "1"--     "17"--     "32"\\
                                      "64"--                                                  "64"/
                                                                                        "55"--  


                             "9"\
                       "6"/       "25"\   
                   "1"--     "17"--    "55"--
                                       "32"--    "64"--

IS IT TRUE???

Please help me!! Thanks very much.....

Well your diagram made NO sense at all.

What reading have you done?
http://faq.cprogramming.com/cgi-bin/...ect=1073086407
http://www.nist.gov/dads/

The best thing is if you eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Temporibus autem quibusdam et aut officiis debitis aut rerum necessitatibus saepe eveniet ut et voluptates repudiandae sint et molestiae non recusandae. Itaque earum rerum hic tenetur a sapiente.

I hope that helps.

A binary tree can be converted to an AVL tree, but that is not what you normally do. It should always be an AVL tree, right from the start.

Other than that the answer is 42.