DAY 22

最新推荐文章于 2023-03-01 21:12:12 发布

qq_41512555

最新推荐文章于 2023-03-01 21:12:12 发布

阅读量62

点赞数

文章标签： leetcode 算法深度优先

本文链接：https://blog.csdn.net/qq_41512555/article/details/127702582

版权

DAY 22

235. 二叉搜索树的最近公共祖先 - 力扣（Leetcode）

/**
 * 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:
    TreeNode* dfs(TreeNode* root, TreeNode* p, TreeNode* q)
    {
        if(!root) return root;
        if(root->val < p->val && root->val < q->val)
        {
            auto right = dfs(root->right,p,q);
            if(right != NULL)
            {
                return right;
            }
        }
        if(root->val > p->val && root->val > q->val)
        {
            auto left = dfs(root->left,p,q);
            if(left != NULL)
            {
                return left;
            }
        }
        return root;
    }
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        return dfs(root,p,q);

        
    }
};

701. 二叉搜索树中的插入操作 - 力扣（Leetcode）

/**
 * 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* insertIntoBST(TreeNode* root, int val) {
        //插入用节点，用new
        if(!root) return new TreeNode(val);
        if(root->val > val) root->left = insertIntoBST(root->left,val);
        if(root->val < val) root->right = insertIntoBST(root->right,val);
        return root;
         

    }
};

450. 删除二叉搜索树中的节点 - 力扣（Leetcode）

/**
 * 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) return NULL;
        if(root->val > key) root->left = deleteNode(root->left,key);
        else if(root->val < key) root->right = deleteNode(root->right,key);
        else
        {
            if(!root->left) return root->right;
            if(!root->right) return root->left;
            else{
                auto cur = root->right;
                while(cur->left)
                {
                    cur = cur->left;
                }
                cur->left = root->left;
                root = root->right;
            }
        }
        return root;

    }
};