Practice: Binary Search Trees

Take out a piece of paper. We’ll be programming on paper.

Problem 1

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

public class BinarySearchTree<E> {
  private BinaryNode<E> root;
  private Comparator<E> c;

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

  private class BinaryNode<E> {
    private E data;
    private BinaryNode<E> left;
    private BinaryNode<E> right;
  }
}

• You should use a recursive helper method.

Show me your code before you leave