Methods : Consider a BST (binary search tree) data structure. Write java implementation for the following methods. Use students class as explained above. A recursive int height() method which returns ...

The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right ...