Practice: Binary Search Trees

Take out a piece of paper.

• Implement the delete(E target) 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 delete(E target) {
   // your code
  }

}

Hint: Left child index = 2 x parentIndex + 1. Right child index = 2 x parentIndex + 2. ParentIndex = (childIndex -1)/2

Show me your code before you leave