Binary Search Tree - Java Pt. 3

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

// Constructor:

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

// Methods:

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(TreeNode theNewLeft) { left = theNewLeft; }
public void setRight(TreeNode theNewRight) { right = theNewRight; }
}