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 ...

When comparing binary search tree (BST) implementations in Java, each has trade-offs. Standard BSTs are simple and memory-efficient but slow to O(n) if unbalanced.

For this assignment you will be implementing the Binary Search Tree ADT and a number of associated functions. It would be very helpful to read chapters 9 and 10 in the Java Software Structures book.