Answer Happy

D Question 2 a) Show the AVL tree that results after each of the integer keys 10, 28, 55, 22, 3, 23, and 40 are inserted, in that order, into an initially empty AVL tree. Clearly show the tree that results after each insertion, and make clear any rotations that must be performed. (15 points) b) Draw the resulting BST after 23 is inserted, but before any rebalancing takes place. Label each node in the resulting tree with its balance factor. (5 points) Upload Choose a File Question 3 e 20 pts 70 30 pts Show what the tree looks like after each of the following sequences of operations (draw the tree only after the last operation in each sequence). For deleting a node with two children, replace it with the inorder successor. (a) Insert 31 (b) Insert 68 (c) Insert 20 (d) Delete 35 (e) Delete 25 (f) Delete 50