Repeat the previous problem, considering the case in which ys children start with different heights. Previous problem

Question:

Repeat the previous problem, considering the case in which y€™s children start with different heights.


Previous problem

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?

h+2 h+1 h-1 h-1 Tj T4 T, T, (a) |h+3 h+2 h+1 h-1 х T4 T2 T3 (b) h+2 h+1 h+1 х h-1 T2 T1 T3 T4

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Data Structures and Algorithms in Java

ISBN: 978-1118771334

6th edition

Authors: Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser

Question Posted: