The following tree is a binary search tree and the numbers on the nodes are just the labels of them and not the values in them. Answer the following questions. 9 10 12 15

13. The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure? def printTree (Tree) : if (Tree is not None): print (Tree.Value) printTree (Tree.Left) printTree (Tree.Right) А. C. B A B B B.

Course: Data Structure and Algorithms Language: Java Topic: AVL Tree Kindly solve this question prperly step by step and complete.   AVL Tree basics Draw the AVL tree after performing each of the following operations consecutively on an initially empty binary search tree: insert 8, insert 6, insert 12, insert 3, insert 10, insert 9, delete 12, delete 8, insert 7, insert 8.  If you delete an item from an AVL tree and then insert it back into the tree, will you always get back the original AVL tree? Justify your answer.

5. Draw the final binary search tree that results after inserting the following keys in the order they appear here: 24 18 67 68 69 25 19 20 11 93