Create a class that implements a binary search tree using generics. You can use the file BinarySearchTree.java as a template for your class. Your class must implement all of the methods as specified in the comments of the BinarySearchTree.java file. You should use a linked implementation and use JUnit to test and verify that your class works as specified.
As usual, use good programming techniques. You should use good variable names, whitespace, comments, and follow the Java coding conventions. Make your code easy to read and understand by keeping lines of code and methods simple and short.
Submission: Tar your code and copy it to the directory ~bouchard/CPSC220/assign2 on cs.roanoke.edu by 8:40AM on Monday, September 20th.