Java programing:

In this assignment, you are to implement exercises 19.15, and 19.16 on page 766 of the book.

You need to start with the BinaryNode.java and the BinarySearchTree.java files provided for

you in the text. I recommend that you type them instead of obtaining them from the book's

website.

In order to test your code, you need to implement a driver program for this assignment.

Your driver program must test all the methods that are provided in the BinarySearchTree

class implementation repeatedly. So, what you need to do is go into a while loop and a

switch statement within it to handle all the choices.

while quit was not selected

switch(choice)

case 1:

Insert

case 2:

find

.

.

.

default:

quit.

end switch

end while

You need to submit all three files (BinaryNode.java, BinarySearchTree.java, and the driver)

You must not make any changes to the BinaryNode.java file, but submit it anyway.

Good Luck

19.15 : Implement find , findmin and findMax recursively;

19.16: implement findkth nonrecursively , using the same technique used for a nonrecursive find.