代码随想录训练营第二十二天 | 235. 二叉搜索树的最近公共祖先 | 701.二叉搜索树中的插入操作 | 450.删除二叉搜索树中的节点

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

题目链接：. - 力扣（LeetCode）

文档讲解：代码随想录

视频讲解：二叉搜索树找祖先就有点不一样了！| 235. 二叉搜索树的最近公共祖先_哔哩哔哩_bilibili

状态：未通过

递归法代码实现：

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root->val > p->val && root->val > q->val){
            return lowestCommonAncestor(root->left, p, q);
        }
        else if(root->val < p->val && root->val < q->val){
            return lowestCommonAncestor(root->right, p, q);
        }
        else return root;

    }
};

 迭代法代码实现：

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        while(root != NULL){
            if(root->val > p->val && root->val > q->val){
                root = root->left;
            }
            else if(root->val < p->val && root->val < q->val){
                root = root->right;
            }
            else return root;
        }
        return NULL;
    }
};

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

题目链接：. - 力扣（LeetCode）

文档讲解：代码随想录

视频讲解：原来这么简单？ | LeetCode：701.二叉搜索树中的插入操作_哔哩哔哩_bilibili

状态：未通过

递归法代码实现：

class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        if(root == NULL){
            TreeNode* node = new TreeNode(val);
            return node;
        }
        if(root->val > val){
            root->left = insertIntoBST(root->left, val);
        }
        if(root->val < val){
            root->right = insertIntoBST(root->right, val);
        }
        return root;
    }
};

 迭代法代码实现：

class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        TreeNode* node = new TreeNode(val);
        if(root == NULL) return node;
        TreeNode* pre = root;
        TreeNode* cur = root;
        while(cur != NULL){
            pre = cur;
            if(cur->val > val) cur = cur->left;
            else cur = cur->right;
        }
        if(pre->val > val) pre->left = node;
        else pre->right = node;
        return root;
    }
};

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

题目链接：. - 力扣（LeetCode）

文档讲解：代码随想录

视频讲解：调整二叉树的结构最难！| LeetCode：450.删除二叉搜索树中的节点_哔哩哔哩_bilibili

状态：未通过

递归法代码实现：

class Solution {
public:
    TreeNode* deleteNode(TreeNode* root, int key) {
        if(root == NULL) return NULL;
        if(root->val == key){
            if(root->left == NULL && root->right == NULL){
                delete root;
                return NULL;
            }
            else if(root->left == NULL){
                auto retNode = root->right;
                delete root;
                return retNode;
            }
            else if(root->right == NULL){
                auto retNode = root->left;
                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;
    }
};

迭代法代码实现：

class Solution {
private:
    TreeNode* deleteOneNode(TreeNode* cur){
        if(cur->left == NULL && cur->right == NULL) return NULL;
        else if(cur->right == NULL) return cur->left;
        else{
            TreeNode* node = cur;
            cur = cur->right;
            while(cur->left){
                cur = cur->left;
            }
            cur->left = node->left;
            TreeNode* tmp = node;
            node = node->right;
            delete(tmp);
            return node;
        }
    }
public:
    TreeNode* deleteNode(TreeNode* root, int key) {
        if(root == NULL) return NULL;
        TreeNode* pre = NULL;
        TreeNode* cur = root;
        while(cur){
            if(cur->val == key) break;
            pre = cur;
            if(cur->val > key) cur = cur->left;
            else cur = cur->right;
        }
        if(pre == NULL) return deleteOneNode(cur);

        if(pre->left != NULL && pre->left->val == key) pre->left = deleteOneNode(pre->left);
        if(pre->right != NULL && pre->right->val == key) pre->right = deleteOneNode(pre->right);

        return root;
    }
};