leetcode-235

笨笨小菜

于 2021-03-01 23:11:42 发布

阅读量80

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/shushi6969/article/details/114274143

版权

leetcode 专栏收录该内容

210 篇文章 0 订阅

订阅专栏

https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/

思路：二叉搜索树性质

TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
    if (root->val > min(p->val, q->val) && (root->val < max(p->val, q->val))) {
        return root;
    }
    if (root->val > q->val && root->val > p->val) {
        return lowestCommonAncestor(root->left, p, q);
    }
    if (root->val < q->val && root->val < p->val) {
        return lowestCommonAncestor(root->right, p, q);
    }
    return root;
}

非递归
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
    while(root) {
        if (root->val < p->val && root->val < q->val) {
            root = root->right;
        } else if (root->val > p->val && root->val > q->val) {
            root = root->left;
        } else {
            return root;
        }
    }
    return NULL;
}