S. (20) if the above tree is an AVL tree what would be the final tree after the same set of operations? 6. (10) List the resulting AVL tree in Postorder Using the class definitions below, implement the following methods public class BTNode within class BST private int value; private BTNode rnode; private BTNode 1node: public BTNode (int v){ value-v; rnode inul 1 ; 1node-null;} public int getvalue () public BTNode getrnode ) return (rnode)h public BTNode getlnode () ( return (1node) public void setvalue (int v) value v; ) public void setrnode (BTNode r) (rnode r public void setlnode (BTNode 1) (lnode 1: , return (value)) public class BST private BTNode root; (10) Implement a recursive method named public int largest(BTNode n) that returns the largest value in a subtree whose root node is n. 7. (15) Implement a recursive method named public int addinorder(BTNode n) that returns the sum of all of the values stored in the subtree of node n. 8. (20) Implement a recursive method named public int depth(BTNode n, int d) where n is the current node and d is the current depth of the node. The method returns the length of the longest path from node n to a leaf in its subtree. 9