D Question 2 20 pts a) Show the AVL tree that results after each of the integer keys 10, 28, 55, 22, 3, 23, and 40 are i
Posted: Fri Jul 01, 2022 5:43 am
Question 2 20 pts 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
D