Day22| 235 二叉搜索树的最近公共祖先 701 二叉搜索树中的插入操作 450 删除二叉搜索树中的节点

蝶海梦花、

已于 2024-02-19 19:55:31 修改

阅读量1.4k

点赞数 3

文章标签：算法

于 2024-02-19 19:53:40 首次发布

本文链接：https://blog.csdn.net/m0_74082772/article/details/136177113

版权

235 二叉搜索树的最近公共祖先

701 二叉搜索树中的插入操作

450 删除二叉搜索树中的节点

235 二叉搜索树的最近公共祖先

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL) return NULL;

        if(root->val == p->val || root->val == q->val){
            return root;
        }

        TreeNode* left = lowestCommonAncestor(root->left, p, q);
        TreeNode* right = lowestCommonAncestor(root->right, p, q);

        if(left != NULL && right != NULL){
            return root;
        }

        if(left == NULL && right != NULL){
            return right;
        }

        if(left != NULL && right == NULL){
            return left;
        }
        return NULL;
    }
};

701 二叉搜索树中的插入操作

class Solution {
public:
    TreeNode* insert(TreeNode* root, int val){
        if(root == NULL){
            TreeNode* node = new TreeNode(val);
            return node;
        }

        if(root->val > val) {
            root->left = insert(root->left, val);
        }

        if(root->val < val) {
            root->right = insert(root->right, val);
        }
        return root;
    }

    TreeNode* insertIntoBST(TreeNode* root, int val) {
        return insert(root, val);;
    }

 
};

450 删除二叉搜索树中的节点

class Solution {
public:
    TreeNode* deleteNode(TreeNode* root, int key) {
        if(root == NULL) return root;
        if(root->val == key){
            if(root->left == NULL && root->right == NULL){
                delete root;
                return NULL;
            }
            else if(root->right == NULL){
                auto retNode = root->left;
                delete root;
                return retNode;
            }
            else if(root->left == NULL){
                auto retNode = root->right;
                delete root;
                return retNode;
            }else{
                TreeNode* cur = root->right;
                while(cur->left != NULL){
                    cur = cur->left;
                }
                cur->left = root->left;
                TreeNode* tmp = root;
                root = root->right;
                delete tmp;
                return root;
            }
        }
        if(root->val > key){
            root->left = deleteNode(root->left, key);
        }

        if(root->val < key){
            root->right = deleteNode(root->right, key);
        }
        return root;
    }
};