Java集合与数据结构-二叉搜索树

class Node {
    int key;
    Node left;
    Node right;

    public Node(int key) {
        this.key = key;
    }
}
public class TestDemo3 {
    private Node root = null;

    /**
     * 查找
     * @param key
     * @return
     */
    public Node search(int key) {
        Node cur = root;
        while (cur != null) {
            if (key == cur.key) {
                return cur;
            } else if (key > cur.key) {
                cur = cur.right;
            } else {
                cur = cur.left;
            }
        }
        return null;
    }
    //插入
    public boolean insert(int key) {
        if (root == null) {
            root = new Node(key);
            return true;
        }
        Node cur = root;
        Node parent = null;
        while (cur != null) {
            if (key == cur.key) {
                return false;
            } else if (key > cur.key) {
                parent = cur;
                cur = cur.right;
            } else {
                parent = cur;
                cur = cur.left;
            }
        }
        Node node = new Node(key);
        if (key < parent.key) {
            parent.left = node;
        } else {
            parent.right = node;
        }
        return true;
    }
    //删除
    public void remove(int key) {
        if (root == null) return;
        Node cur = root;
        Node parent = null;
        while (cur != null) {
            if (cur.key == key) {
                removeNode(parent,cur,key);
            } else if (cur.key < key) {
                parent = cur;
                cur = cur.right;
            } else {
                parent = cur;
                cur = cur.left;
            }
        }
    }
    public void removeNode(Node parent,Node cur,int key) {
        if (cur.left == null) {
            if (cur == root) {
                root = cur.right;
            } else if (cur == parent.left) {
                parent.left = cur.right;
            } else {
                parent.right = cur.right;
            }
        } else if (cur.right == null) {
            if (cur == root) {
                root = cur.left;
            } else if (cur == parent.left) {
                parent.left = cur.left;
            } else {
                parent.right = cur.left;
            }
        } else {
            Node targetParent = cur;
            Node target = cur.right;
            while (target.left != null) {//target的左边的最小值比target小,比targetParent大
                targetParent = target;
                target = targetParent.left;
            }
            cur.key = target.key;
            if (target == targetParent.left) {
                targetParent.left = target.right;//相当于将target删除，换成target的右，target的右比tp小
            } else {
                targetParent.right = target.right;//左树本来就为空
            }
        }
    }
}