day 22 第六章二叉树

最新推荐文章于 2023-05-25 17:56:51 发布

风华正茂，挥斥方遒

最新推荐文章于 2023-05-25 17:56:51 发布

阅读量93

点赞数

分类专栏： leetcode 文章标签：算法 leetcode 职场和发展

本文链接：https://blog.csdn.net/studyingforever666/article/details/127894855

版权

二叉搜索树最近公共祖先插入操作删除操作递归

关键词由CSDN通过智能技术生成

leetcode 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

第六章二叉树

今日内容

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

// 讨论6种情况，其中4种情况都是返回root，其中2种情况需要继续向下递归遍历。
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
#if 0
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        // 终止条件
        if (root == nullptr || p == nullptr || q == nullptr) return nullptr;
        if (p->val > q->val) swap(p, q);
        if (p->val == root->val || q->val == root->val) return root;
        if (p->val < root->val && q->val > root->val) return root;
        if (p->val > root->val) return lowestCommonAncestor(root->right, p, q);
        return lowestCommonAncestor(root->left, p, q);
    }
#endif
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if (p->val > root->val && q->val > root->val)
            return lowestCommonAncestor(root->right, p, q);
        else if (p->val < root->val && q->val < root->val)
            return lowestCommonAncestor(root->left, p, q);
        else
            return root;
    }
};

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
#if 0
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        insertNode(root, val);
        return root;
    }
    void insertNode(TreeNode* &root, int val) {
        if (root == nullptr) {  // 空树
            root = new TreeNode(val);
            return;
        }
        if (val < root->val) insertNode(root->left, val);
        if (val > root->val) insertNode(root->right, val);
    }
#endif
    TreeNode* insertIntoBST(TreeNode* root, int val) {
        if (root == nullptr) return new TreeNode(val);
        if (val < root->val) root->left = insertIntoBST(root->left, val);
        if (val > root->val) root->right = insertIntoBST(root->right, val);
        return root;
    }
};

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
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) {
                delete root;
                return nullptr;
            }
            else if (root->left == nullptr) {
                TreeNode *node = root->right;
                delete root;
                return node;
            } else if (root->right == nullptr) {
                TreeNode *node = root->left;
                delete root;
                return node;
            } else {  
                TreeNode* cur = root->right;
                while (cur->left != nullptr) cur = cur->left;
                cur->left = root->left;
                TreeNode* tmp = root;
                root = root->right;
                delete tmp;
                return root;
            }
        }
        if (key < root->val) root->left = deleteNode(root->left, key);
        if (key > root->val) root->right = deleteNode(root->right, key);
        return root;
    }
};