AVL TREE

3. [12 pts.] Complete the pseudocode of the singleRotation method, corresponding to the proper single-rotation restructure operation in an AVL-tree, and started for you in the partial pseudocode given in Algorithm 7, by writing down the six missing statements (in line indexes 3, 6, 10, 13, 15, and 18).

Algorithm 7 singleRotation(r,y, 2) 1: w 2.parent 2: x.parenty 3: 4. .parent w 5: if y- z.left then 6 7: 8: else 9:z.right +- y.left 10: 11 end if 12. fz-w.left then 13 14: else 15 16: end if 17: resetHeight(z) 18 19: resetHeight(w) 20: return u Algorithm 7 singleRotation(r,y, 2) 1: w 2.parent 2: x.parenty 3: 4. .parent w 5: if y- z.left then 6 7: 8: else 9:z.right +- y.left 10: 11 end if 12. fz-w.left then 13 14: else 15 16: end if 17: resetHeight(z) 18 19: resetHeight(w) 20: return u