Write java implementation for the following methods. Use students class as explained above. A recursive int height () method which returns the height of the tree. If the tree is empty, return -1. The ...

* Given a binary tree, determine if it is height-balanced. * For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never ...