// Class SearchTreeNode is used to build binary search trees.

public class SearchTreeNode<E extends Comparable<E>> {
    public E data;                   // data stored in this node
    public SearchTreeNode<E> left;   // reference to left subtree
    public SearchTreeNode<E> right;  // reference to right subtree

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

    // post: constructs a SearchTreeNode with the given data and links
    public SearchTreeNode(E data, SearchTreeNode<E> left,
                          SearchTreeNode<E> right) {
        this.data = data;
        this.left = left;
        this.right = right;
    }
}