import java.util.Iterator;

public class BinarySearchTree<T extends Comparable<T>> implements Iterable<Node<T>> {

  public boolean add(T value) {
  }

  public Node<T> find(T value) {
  }

  public boolean remove(T value) {
  }

  int getSize() {
  }

  public Node<T> getRoot() {
  }

  @Override
  public Iterator<Node<T>> iterator() {
  }
}