Modify Binary Search Tree ADT

Part 1: Modify the [login to view URL] class definition as directed by the comment statements, which will direct you to implement methods for the following operations: Return true if the tree is empty; false otherwise. Make the tree empty. Display the values of the tree using an inorder, preorder or postorder traversal of the tree. 3 separate modules. (Use recursive methods.) Return the maximum value in the tree. (Use a recursive method.) Return the minimum value in the tree. (Use a recursive method.) Return the count of the number of nodes in the tree. (Use a recursive method.) Return the count of the number of leaf nodes in the tree. (Use a recursive method.) Part 2: Write a Java program named TreeTest that will fully test this new set of methods. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. And comments explaining each method. Complete copyrights to all work purchased. ## Platform Windows 98+