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

最新推荐文章于 2024-10-07 19:00:27 发布

千束ღ泷奈

最新推荐文章于 2024-10-07 19:00:27 发布

阅读量583

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_45507687/article/details/127885451

版权

题目链接

递归法

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

迭代法 (感动到痛哭流涕🥲🥲🥲)

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