+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Explain why performing a rotation in an n-node binary tree when using the arraybased…

1. Explain why performing a rotation in an n-node binary tree when using the arraybased…

1. Explain why performing a rotation in an n-node binary tree when using the arraybased representation of Section 8.3.2 takes Ω(n) time.2. Consider a deletion operation in an AVL tree that triggers a trinode restructuring for the case in which both children of the node denoted as y have equal heights. Give a schematic figure, in the style of Figure 11.12, showing the tree before and after the deletion. What is the net effect of the height of the rebalanced subtree due to the operation?Figure 11.12