package rebelsky.exam3;

/**
 * Nodes for a binary search tree used to implement sets.
 * Unlike the BSTNodes used to implement dictionaries, these
 * contain only values, and not keys.
 */
class BSTNode<T>
{
// +--------+--------------------------------------------------
// | Fields |
// +--------+

   /**
    * The value stored in the node.
    */
   T value;

   /**
    * The left subtree.
    */
   BSTNode<T> left;

   /**
    * The right subtree.
    */
   BSTNode<T> right;

// +--------------+--------------------------------------------
// | Constructors |
// +--------------+

  /**
   * Create a new BSTnode
   */
  public BSTNode(T _value)
  {
    this.value = _value;
  } // BSTNode()


} // class BSTNode