二叉排序树实现

package src.bst;

public class BinarySortTreeDemo {

    public static void main(String[] args){

        int[] arr = new int[]{7, 3, 10, 12, 5, 1, 9, 2};
        BinarySortTree bst = new BinarySortTree();
        for(int i=0;i<arr.length;i++){
            bst.add(new TreeNode(arr[i]));
        }

        bst.infixOrder();

        bst.delete(7);

        System.out.println("\n");
        bst.infixOrder();
    }
}

// 创建二叉排序树
class BinarySortTree{

    private TreeNode root;

	// 创建、添加节点
    public void add(TreeNode node){
        if(root == null){
            this.root = node;
        }else {
            root.add(node);
        }
    }

	// 遍历节点
    public void infixOrder(){
        if(root != null){
            root.infixOrder();
        }else {
            System.out.println("二叉排序树为空");
        }
    }

    // 查找当前节点
    public TreeNode search(int value){
        if(root == null){
            return null;
        }else {
            return root.search(value);
        }
    }

    // 查找父节点
    public TreeNode searchParent(int value){
        if(root == null){
            return null;
        }else {
            return root.searchParent(value);
        }
    }

    /**
     *
     * @param node 需要被填充的节点
     * @return 返回以node为根的最小节点的值
     */
    public int deleteRightMin(TreeNode node){
        TreeNode target = node;
        while (target.left != null){
            target = target.left;
        }
        delete(target.value);
        return target.getValue();
    }

    // 删除节点
    public void delete(int value){
        if(root == null){
            return;
        }else if(root.left == null && root.right == null){
            root = null;
            return;
        }else  {
            // 找到节点
            TreeNode targetNode = this.search(value);
            if(targetNode == null){
                return;
            }

            // 找到父节点
            TreeNode parent = this.searchParent(value);

            // 1、目标节点为叶子节点
            if(targetNode.left == null && targetNode.right == null){
                if(parent.left != null && parent.left.value == targetNode.value){
                    parent.left = null;
                }else {
                    parent.right = null;
                }
            }else if(targetNode.left != null && targetNode.right != null){ // 2、目标节点有两颗子树
                int minValue = deleteRightMin(targetNode.right);
                targetNode.value = minValue;
            }else { // 3、目标节点只有一颗子树
                if(targetNode.left != null){ // 目标节点左子树不为空
                    if(parent != null){
                        // targetNode 是父节点的左节点
                        if(parent.left != null && parent.left.value == targetNode.value){
                            parent.left = targetNode.left;
                        }else { // targetNode 是父节点的右节点
                            parent.right = targetNode.left;
                        }
                    }else {
                        root = targetNode.left;
                    }
                }else{ // 目标节点右子树不为空
                    if(parent != null){
                        if(parent.left != null && parent.left.value == targetNode.value){
                            parent.left = targetNode.right;
                        }else {
                            parent.right = targetNode.right;
                        }
                    }else {
                        root = targetNode.right;
                    }
                }
            }
        }
    }
}

// 创建Node节点
class TreeNode{

    int value;

    TreeNode left;

    TreeNode right;

    public TreeNode(int value) {
        this.value = value;
    }

    public int getValue() {
        return value;
    }

    public void setValue(int value) {
        this.value = value;
    }

    /**
     * 查找节点值
     * @return
     */
    public TreeNode search(int value){
        if(value == this.value){
            return this;
        }else if(value < this.value){
            if(this.left == null){
                return null;
            }
            return this.left.search(value);
        }else {
            if(this.right == null){
                return null;
            }
            return this.right.search(value);
        }
    }

    /**
     *
     * @param value 查找节点值
     * @return  要查找节点的父节点
     */
    public TreeNode searchParent(int value){
        if((this.left != null && this.left.value == value)
                || (this.right!=null && this.right.value == value)){
            return this;
        }else {
            if(value < this.value && this.left != null){
                return this.left.searchParent(value);
            }else if(value >= this.value && this.right != null){
                return this.right.searchParent(value);
            }else {
                return null; // 没有父节点
            }
        }
    }

    public void add(TreeNode node){
        if(node == null){
            return;
        }

        if(node.value < this.value){
            if(this.left == null){
                this.left = node;
            }else {
                this.left.add(node);
            }
        }else {
            if(this.right == null){
                this.right = node;
            }else {
                this.right.add(node);
            }
        }
    }

    public void infixOrder(){
        if(this.left != null){
            this.left.infixOrder();
        }
        System.out.print(this.value + " ");
        if(this.right != null){
            this.right.infixOrder();
        }
    }
}