数据结构与算法（十一）二叉排序树的增删

package tree;

public class BinarySearchTree {
    private static TreeNode root;

    public static void inOrder() {
        if (root != null) {
            root.inOrder();
        } else {
            System.out.println("Tree is empty");
        }
    }

    public static void addNode(TreeNode node) {
        if (root == null) {
            root = node;
        } else {
            root.addNode(node);
        }
    }

    public static void deleteNode(int val) {
        if (root == null) {
            return;
        }
        TreeNode delNode = root.findNode(val);
        if (delNode == null) {//未找到节点
            return;
        }
        TreeNode parentNode = root.findParentNode(val);

        //1.如果当前节点是叶子节点，即左右子树都为空，直接删除
        if (delNode.left == null && delNode.right == null) {
            if(parentNode == null){//当该节点没有左右子节点，且没有父节点，代表该树只有一个root节点
                root = null;
            }else{
                if(parentNode.left != null && parentNode.left.value == val){
                    parentNode.left = null;
                }else{
                    parentNode.right = null;
                }
            }
        }else if(delNode.left != null && delNode.right != null){// 当前节点的左右子树都不为空,找到右子树中最小值于当前节点进行交换
            TreeNode minNode = delNode.right;
            while(minNode.left != null){
                minNode = minNode.left;
            }

            int min = minNode.value;
            //删除最小节点
            deleteNode(minNode.value);
            //将最小值付给当前节点
            delNode.value = min;
        }else{//当前节点有一颗子树

            if(parentNode == null){//当前节点为根点
                if(delNode.left != null ){
                    root = delNode.left;
                }else{
                    root = delNode.right;
                }
            }else {
                //如果当前节点有左子树
                if(delNode.left != null){
                    if(parentNode.left != null && parentNode.left.value == val){//当前节点是父节点的左子节点
                        parentNode.left = delNode.left;
                    }else {//当前节点是父节点的右子节点
                        parentNode.right = delNode.left;
                    }
                }else{//如果当前节点有右子树
                    if(parentNode.left != null && parentNode.left.value == val){//当前节点是父节点的左子节点
                        parentNode.left = delNode.right;
                    }else {//当前节点是父节点的右子节点
                        parentNode.right = delNode.right;
                    }
                }
            }

        }

    }

    public static void main(String[] args) {
        int[] arr = {3, 5, 1, 13, 9, 4, 5, 11};
        BinarySearchTree tree = new BinarySearchTree();
        for (int i : arr) {
            tree.addNode(new TreeNode(i));
        }

        //测试添加
        tree.inOrder();

        //测试删除
        tree.deleteNode(1);
        tree.deleteNode(5);
        tree.deleteNode(9);
        tree.deleteNode(13);
        tree.deleteNode(4);
        tree.deleteNode(5);
        tree.deleteNode(3);
        tree.deleteNode(11);


        System.out.println("===============After delete=====================");
        tree.inOrder();

    }
}

class TreeNode {

    int value;
    TreeNode left;
    TreeNode right;

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

    public void inOrder() {
        if (this.left != null) {
            this.left.inOrder();
        }
        System.out.println(this);
        if (this.right != null) {
            this.right.inOrder();
        }
    }

    //添加节点：
    public void addNode(TreeNode node) {
        if (this.value < node.value) {//传入节点的值大于当前节点值
            if (this.right == null) {//当前节点的右子节点为空，将传入节点挂在右子节点
                this.right = node;
            } else {//向右子树递归添加节点
                this.right.addNode(node);
            }
        } else {//传入节点的值小于等于当前节点
            if (this.left == null) {//当前节点的左子节点为空，将传入节点挂在左子节点
                this.left = node;
            } else {//向左子树递归添加节点
                this.left.addNode(node);
            }

        }
    }

    public TreeNode findNode(int val) {
        if (this.value == val) {
            return this;
        }

        if (this.left != null && this.value > val) {
            return this.left.findNode(val);
        }else if (this.right != null && this.value < val) {
            return this.right.findNode(val);
        }else{
            return null;
        }

    }

    public TreeNode findParentNode(int val) {
        if ((this.left != null && this.left.value == val) || (this.right != null && this.right.value == val)) {
            return this;
        } else {
            if (this.left != null && this.value >= val) {
                return this.left.findParentNode(val);
            } else if (this.right != null && this.value < val) {
                return this.right.findParentNode(val);
            } else {
                return null;
            }
        }
    }


    @Override
    public String toString() {
        return "TreeNode{" +
                "value=" + value +
                '}';
    }



}