1. Complete the implementation of the Linked Binary Tree class presented in this chapter. Specifically, complete the implementations of getRight, contains, isEmpty, toString, preorder, and post order operations. You may need to implement corresponding methods in the BTNode class. The source code for the other methods can be found on the attachment
2. Write a test driver that creates & displays the binary tree
3. Complete the implementation of the LinkedBinarySearchTree class presented in this chapter. Specifically, complete the implementations of findMin and findMax.
4. Create a driver to test your implementation. Add several elements to the tree, and then display the elements in sorted order. Also, display the minimum and maximum element.