Question

Chapter 13: Trees
28. Draw an AVL tree whose elements are inserted in the follo
grey, green, red, black, silver, pink, orange, blue, yellow, white, violet, br
29. Draw the binary search tree resulting from the insertion of the following
39.24, 12, 11,43,73, 26, 35, 29, 13,65
i) Is the tree almost complete?
i) Is the tree an AVL?
What is the height of the tree?
iv) Write the preorder traversal of the tree.
30. Answer the following.​

Answer 1

Answer:

I know the answers but I don't know how to send pic