leetcode：#450. 删除二叉搜索树中的节点

最新推荐文章于 2024-11-16 00:49:04 发布

JACKPENG.

最新推荐文章于 2024-11-16 00:49:04 发布

阅读量168

点赞数

分类专栏： leecode刷文章标签： leetcode 二叉树

本文链接：https://blog.csdn.net/Jack_PJ/article/details/117307585

版权

leecode刷专栏收录该内容

13 篇文章 0 订阅

订阅专栏

leetcode：#450. 删除二叉搜索树中的节点

题目详情
采用Java实现

class Solution {
    public TreeNode deleteNode(TreeNode root, int key) {
        TreeNode deletedNode = root;
        TreeNode deletedParentNode = null;
        while (deletedNode != null && deletedNode.val != key) {
            deletedParentNode = deletedNode;
            if (deletedNode.val < key) {
                deletedNode = deletedNode.right;
            } else {
                deletedNode = deletedNode.left;
            }
        }
        if(notFoundTargetNode(deletedNode)) {
            return root;
        }

        if (deletedNodeContainsLeftAndRightChildren(deletedNode)) {
            TreeNode rightMinChildNode = deletedNode.right;
            TreeNode rightMinChildNodeParent = deletedNode;

            while (rightMinChildNode.left != null) {
                rightMinChildNodeParent = rightMinChildNode;
                rightMinChildNode = rightMinChildNode.left;
            }

            deletedNode.val = rightMinChildNode.val;
            if (rightMinChildNodeParent.left == rightMinChildNode) {
                rightMinChildNodeParent.left = rightMinChildNode.right;
            } else {
                rightMinChildNodeParent.right = rightMinChildNode.right;
            }
            return root;
        }

        TreeNode deletedNodeChild = getDeletedNodeSingleChild(deletedNode);

        if (deletedParentNode == null) { // 删除根节点
            root = deletedNodeChild;
        } else if (deletedParentNode.left == deletedNode) {
            deletedParentNode.left = deletedNodeChild;
        } else {
            deletedParentNode.right = deletedNodeChild;
        }

        return root;
    }

    private boolean deletedNodeContainsLeftAndRightChildren(TreeNode deletedNode) {
        return deletedNode.left != null && deletedNode.right != null;
    }

    private boolean notFoundTargetNode(TreeNode deletedNode) {
        return deletedNode == null;
    }

    private TreeNode getDeletedNodeSingleChild(TreeNode deletedNode) {
        if (deletedNode.left != null) {
            return deletedNode.left;
        } else if (deletedNode.right != null) {
            return deletedNode.right;
        } else {
            return null;
        }
    }
}