Given the following AVL Tree: 15 20 25 30 35 50 40 55 70 60 80...

 

Transcribed Image Text:

Given the following AVL Tree: 15 20 25 30 35 50 40 55 70 60 80 (10) (a) Draw the resulting BST after 50 is removed, but before any rebalancing takes place. Label each node in the resulting tree with its balance factor. Replace a node with both children using an appropriate value from the node's left child. (b) Now rebalance the tree that results from (a). Draw a new tree for each rotation that occurs when rebalancing the AVL Tree (you only need to draw one tree that results from an RI. or LR rotation). You do not need to label these trees with balance factors. Given the following AVL Tree: 15 20 25 30 35 50 40 55 70 60 80 (10) (a) Draw the resulting BST after 50 is removed, but before any rebalancing takes place. Label each node in the resulting tree with its balance factor. Replace a node with both children using an appropriate value from the node's left child. (b) Now rebalance the tree that results from (a). Draw a new tree for each rotation that occurs when rebalancing the AVL Tree (you only need to draw one tree that results from an RI. or LR rotation). You do not need to label these trees with balance factors.