(1).若它的左子树不空，则其左子树上的所有结点的值均小于它根结点的值；

 (2).若它的右子树不空，则其右子树上的所有结点的值均大于它根结点的值；

 (3).它的左、右子树也分别为二叉查找树。

package searchTree;

/**
 * Created by xinfengyao on 16-12-28.
 */
public class BinaryNode<T> {
    T data;
    BinaryNode<T> left;
    BinaryNode<T> right;

    public BinaryNode() {

    }

    public BinaryNode(T data) {
        this(data, null, null);
    }

    public BinaryNode(T data, BinaryNode<T> left, BinaryNode<T> right) {
        this.data =http://www.mamicode.com/ data;
        this.left = left;
        this.right = right;
    }
}