The node for the BST

TreeNode.java

public class TreeNode
{
	private Comparable value;
	TreeNode left, right;

	public TreeNode(Comparable initValue)
	{
		value = initValue;
		left = null;
		right = null;
	}

	public TreeNode(Comparable initValue, TreeNode initLeft, TreeNode initRight)
	{
		value = initValue;
		left = initLeft;
		right = initRight;
	}

	public Comparable getValue()
	{
		return value;
	}

	public TreeNode getLeft()
	{
		return left;
	}

	public TreeNode getRight()
	{
		return right;
	}

	public void setValue(Comparable theNewValue)
	{
		value = theNewValue;
	}

	public void setLeft(Comparable theNewLeft)
	{
		this.left = new TreeNode(theNewLeft);
	}

	public void setRight(Comparable theNewRight)
	{
		right = new TreeNode(theNewRight);
	}
}

The Javas!