构建二叉搜索树

    public static void buildBinarySearchTree(SearchTreeNode currentNode,SearchTreeNode insertNode){
        if (insertNode == null)
        {
            return;
        }

        if (currentNode.value>=insertNode.value){
            if (currentNode.left==null){
                currentNode.left = insertNode;
                return;
            }
            else {
                buildBinarySearchTree(currentNode.left,insertNode);
            }
        }
        else if (currentNode.value<insertNode.value){
            if (currentNode.right == null){
                currentNode.right = insertNode;
                return;
            }
            else {
                buildBinarySearchTree(currentNode.right,insertNode);
            }
        }
    }

}

class SearchTreeNode{
    SearchTreeNode parent ;
    SearchTreeNode left ;
    SearchTreeNode right ;
    int value;

    SearchTreeNode(int value){
        this.value = value;
        parent = null;
        right = null;
        left = null;
    }
}