EECS 2030 E, Fall 2015

Binary Search Tree

 

Your Task

Implement a binary search tree. Start with the code here and implement the missing methods from this API. Specifically, you must implment the size, contains, largestValue, and smallestValue methods. Modify the code as needed to add the necesssary functionality. Modify the main class to allowing testing of the additional methods you wrote.

 

 

--- End of Exercise ---