LintCode "Remove Node in Binary Search Tree"

最新推荐文章于 2023-01-29 15:53:02 发布

weixin_30274627

最新推荐文章于 2023-01-29 15:53:02 发布

阅读量78

点赞数

原文链接：http://www.cnblogs.com/tonix/p/4855294.html

版权

Not hard to find a solution, but there are several corner cases.

class Solution {
public:
    /**
     * @param root: The root of the binary search tree.
     * @param value: Remove the node with given value.
     * @return: The root of the binary search tree after removal.
     */
    TreeNode* removeNode(TreeNode* root, int value) {
        //    Find it
        TreeNode *p = root, *pp = nullptr;
        bool bLeft = false;
        while(p)
        {
            if(p->val == value)
            {
                break;
            }
            pp = p;
            if(p->val < value)
            {
                p = p->right;
            }
            else if(p->val > value)
            {
                p = p->left;
            }
            bLeft = pp->left == p;
        }
        if(!p) return root;

        //    Case 1: no children
        if(!p->left && !p->right)
        {
            if (!pp) return nullptr;
            
            if(bLeft)
                pp->left = nullptr;
            else
                pp->right= nullptr;
            return root;
        }

        //    Compose new left sub-tree
        TreeNode *pl = p->left, *pr = p->right, *pNewSubRoot = nullptr;
        //    Case 2: has both children
        if (pl && pr)
        {
            TreeNode *p0 = pl, *pp0 = pl;
            while(p0->right)
            {
                pp0 = p0;
                p0 = p0->right;
            }
            if(pp0 != p0)
            {
                pp0->right = p0->left;
                p0->left = pl;
            }
            p0->right = pr;

            pNewSubRoot = p0;
        }
        //    Case 3: only 1 child
        else
        {
            TreeNode *pc = pl ? pl : pr;
            if (!pp) return pc;
            if(bLeft)
                pp->left = pc;
            else
                pp->right= pc;
        }

        //    Return
        if(!pp)
        {
            return pNewSubRoot;
        }

        return root;
    }
};