// Class for storing a single node of a binary tree of E

public class SearchTreeNode<E> {
  public E data;
  public SearchTreeNode<E> left;
  public SearchTreeNode<E> right;

  // constructs a leaf node with given data
  public SearchTreeNode(E data) {
    this(data, null, null);
  }

  // constructs a branch node with given data, left subtree,
  // right subtree
  public SearchTreeNode(E data, SearchTreeNode<E> left, 
      SearchTreeNode<E> right) {
    this.data = data;
    this.left = left;
    this.right = right;
  }
}