For this part of the laboratory, you will be using the class BinarySearchTree. The class L13P1 contains test cases to help you better understand the questions. Write the following methods inside the class BinarySeachTree.
Returns the largest object stored in this tree. It throws NoSuchElementException if the tree is empty.
Returns the smallest object stored in this tree. It throws NoSuchElementException if the tree is empty.
Returns the depth of the tree, i.e. the depth of the deepest node of the tree.
A binary tree is a two-tree if either the tree is empty or all its internal nodes have two children.
Last Modified: March 26, 2014