Take out a piece of paper and put your name on the upper right corner.

• Implement the find(E item) method for a Binary Search Tree. Use the Comparator<E> c to determine the order.

public class BinarySearchTree<E> {
  private E[] treeData;
  private Comparator<E> c;

  public E find(E item) {
   // your code
  }

}

• You can use a helper method.

• Be sure to write JavaDoc comments for your code.

• Conduct a quick review of your code, before you are done.

• After the code, write an explanation the Big-O performance of the method(s).

• Bonus point: Write the Stack interface.

• Hand in your code when you are done.

• Take a short break and be back in your seats at

Time remaining: