2. Implement the following interface to implement a binary search tree in Java public interface BinaryTree<T extends Comparable<? super T>> { public void insert(T data); public T findMin(); public boolean contains(T data); public void remove(T data); } 2.1. (optional) What does T extends Comparable< super T>> mean? Ans: It means that T has to be of type Comparable, which can avoid redundantly specifying type parameters

3. Trees (binary and otherwise) form the basis of many common data structures. Please describe some of these data structures and when they might be used.

4. Implement a basic Thread Pool in Java. When it’s completed, discuss the trade offs of your implementation. If you had unlimited time, discuss what improvements you would make to it and how these improvements would help developers that used your thread pool.

5. The user of this class expected the output “Num: 1000000”. They got something else. What went wrong and how would you fix it? public class Test { public final static int NUMTHREADS = 1000; public final static int NUMLOOP = 1000; public static int num = 0; static class Mythread extends Thread { @Override public void run() { for (int i = 0; i < NUMLOOP; i++) { ++num; } } } public static void main(String argv[]) { Mythread threads[] = new Mythread[NUMTHREADS]; for (int i = 0; i < NUMTHREADS; ++i) { threads[i] = new Mythread(); threads[i].start(); } try { for (int i = 0; i < NUMTHREADS; ++i) { threads[i].join(); } } catch (InterruptedException e) { } System.out.println("Num: " + num); } }