Consider This Pseudocode Method Definition For An Avl Treerebalance Method Se Avltreerebalance Tree Node Avltreeupd 1 (48.57 KiB) Viewed 30 times
Consider This Pseudocode Method Definition For An Avl Treerebalance Method Se Avltreerebalance Tree Node Avltreeupd 2 (28.22 KiB) Viewed 30 times
Consider this pseudocode method definition for an AVL TreeRebalance method. SE AVLTreeRebalance(tree, node) { AVLTreeUpdateHeight (node) if (AVLTreeGetBalance (node) -2) { if (AVLTreeGetBalance (node-right) == 1) { // Double rotation case. AVLTreeRotateRight(tree, node-right) } return AVLTreeRotateLeft(tree, node) } else if (AVLTreeGetBalance(node) == 2) { if (AVLTreeGetBalance (node-left) == -1) { 11 Double rotation case. AVLTreeRotateLeft(tree, node--left) } return AVLTreeRotateRight(tree, node) 3 return node Assume you are given an AVL tree with only a root node (ie, tree height = 0). The root node's value = 26. Which of the following is true after the following method calls are invoked: add (14); add (17); add(18) add(5): remove(14);
return node } Assume you are given an AVL tree with only a root node (i.e. tree height = 0). The root node's value = 26. Which of the following is true after the following method calls are invoked: add(14); add(17); add(18); add(5); remove(14); add(20); O Tree height 2 root node = 17, right child of node 17 node 20 .b. Tree height = 2,root node 20, right child of node 20 anode 26 De Tree height = 3, root node = 17, right child of node 17 anode 26 Od Tree height - 2, root node = 20,left child of node 20 = node 17 Clear my choice
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!