1/3

2/3

3/3

This programming assignment involves adding functionality to the SearchTreeset implementation found in the SetMap project. Specifically you will edit the file util.SearchTreeSet and write Java-correct implementations of these methods * first pollFirst headset e lower The goal is to make these methods behave exactly like they would for a Java Treeset. Additional programming requirements the first, pollFirst, and lower methods should just take one or two passes down the tree. For a "well-balanced" tree, the time should be O(log(n)) the headset method, although O(n), should be done as efficiently as possible One thing to ignore in the description of the headSet method is that it returns a view of the portion of this set. Look at JavaDoc Documentation For the Java operations, select its usage, right-click and run Show JavaDoc to see what Java says about the behavior. For example, to see the JavaDoc of pollFirst, work with the selection java tree.pollFirst)i Skeleton Program Add the following starter code at the end of the class, fix the imports (for SortedSet), and set YOUR NAME util.Search TreeSet public class SearchTreeset extends NavsetAdapter