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

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

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

//迭代法
class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        while(root){
            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 break;
        }
        return root;
    }
};

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

class Solution {
public:
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        if(root == nullptr){
            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;
    }
};

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

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

        if(root->left) root->left = deleteNode(root->left,key);
        if(root->right) root->right = deleteNode(root->right,key);
        return root;
    }
};