Given the following AVL Tree: Draw the resulting BST after 5 is removed, but before any...

 

Transcribed Image Text:

Given the following AVL Tree: Draw the resulting BST after 5 is removed, but before any rebalancing takes place. To replace Node 5, you can use any node from the left subtree, and if the newly chosen node to be used has any children, rearrange the tree accordingly. Label each node in the resulting tree with its balance factor. 2 3 5 10 11 1 6 12 8 Q4: Now rebalance the tree that results from Q3. 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 RL or LR rotation). You do not need to label these trees with balance factors. Given the following AVL Tree: Draw the resulting BST after 5 is removed, but before any rebalancing takes place. To replace Node 5, you can use any node from the left subtree, and if the newly chosen node to be used has any children, rearrange the tree accordingly. Label each node in the resulting tree with its balance factor. 2 3 5 10 11 1 6 12 8 Q4: Now rebalance the tree that results from Q3. 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 RL or LR rotation). You do not need to label these trees with balance factors.