cpp二叉树删除节点

最新推荐文章于 2024-09-30 07:31:33 发布

Hilbert996

最新推荐文章于 2024-09-30 07:31:33 发布

阅读量380

点赞数 8

文章标签： c++ 算法开发语言

本文链接：https://blog.csdn.net/m0_67016633/article/details/135442508

版权

感觉精髓在于这张图

代码自己写的很啰嗦，日后改进。

    TreeNode *pre;
    TreeNode* deleteNode(TreeNode* root, int key) {
        if(root == nullptr)
            return root;
        if(root->val == key){
            if(pre == nullptr){
                if(root->right == nullptr){
                    root = root->left;
                }else{
                    TreeNode *r = root->right;
                    TreeNode *l = root->left;
                    // cout << root->left->val << endl;
                    root = root->right;
                    while(r->left != nullptr){
                        r = r->left;
                    }
                    r->left = l;
                }               
            }else{
                if(pre->val > root->val){
                    if(root->right == nullptr){
                        pre->left = root->left;
                    }else{
                        TreeNode *node = root->left;
                        // cout << root->left->val << endl;
                        pre->left = root->right;
                        TreeNode *l = root->right;
                        while(l->left != nullptr){
                            l = l->left;
                        }
                        l->left = node;
                    }
                }else if(pre->val < root->val){
                    if(root->right == nullptr){
                        pre->right = root->left;
                    }else{
                        TreeNode *node = root->left;
                        pre->right = root->right;
                        TreeNode *l = root->right;
                        while(l->left != nullptr){
                            l = l->left;
                        }
                        l->left = node;
                    }
                }
            }
        }else{
            pre = root;
            deleteNode(root->left, key);
            pre = root;
            deleteNode(root->right, key);
        }
        return root;