22代码随想录训练营day22|二叉树part08

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

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

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;
    }
};

2、二叉搜索树中的插入操作

二叉搜索树中的插入操作

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;
    }
};

3、删除二叉搜索树中的结点

删除二叉搜索树中的结点

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