Complete the pseudocode for the REBALANCE method (shown below as Algorithm 2 and described in the...

Transcribed Image Text:

Complete the pseudocode for the REBALANCE method (shown below as Algorithm 2 and described in the previous question), which corresponds to a particular implementation of the proper restructure operation that needs to be applied to the subtree rooted at the input node z in an AVL tree Algorithm 2 REBALANCE(2) 1; if HEIGHT(z.left) > HEIGHT(z.right) then 2: 3: else 4: 5: 6: if d <0 or (d = 0 and y = 2.right) then 7: 8: else 9: 10: if (y=z.left) = (x = y.left) then 11: 12: else 13: 14: Statement 2 Statement 4 Statement 5 Statement 7 Statement 9 Statement 11 Statement 13 Statement 14 [Choose [Choose] [Choose] [Choose] [Choose] [Choose] [Choose] [Choose] C 0 O O Complete the pseudocode for the REBALANCE method (shown below as Algorithm 2 and described in the previous question), which corresponds to a particular implementation of the proper restructure operation that needs to be applied to the subtree rooted at the input node z in an AVL tree Algorithm 2 REBALANCE(2) 1; if HEIGHT(z.left) > HEIGHT(z.right) then 2: 3: else 4: 5: 6: if d <0 or (d = 0 and y = 2.right) then 7: 8: else 9: 10: if (y=z.left) = (x = y.left) then 11: 12: else 13: 14: Statement 2 Statement 4 Statement 5 Statement 7 Statement 9 Statement 11 Statement 13 Statement 14 [Choose [Choose] [Choose] [Choose] [Choose] [Choose] [Choose] [Choose] C 0 O O

Answer rating: 100% (QA)

Heres the completion of the pseudocode for the REBALANCE method Algorithm 2 REBALANCEz 1 if HEIGHTzl... View the full answer