跳转至

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

Leetcode题目链接

描述⚓︎

详见中文题目链接。

解答⚓︎

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
/**
 * 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->val != p->val && root->val != q->val) {
            if (min(p->val, q->val) < root->val && root->val < max(p->val, q->val))
                break;
            root = root->val < min(p->val, q->val) ? root->right : root->left;
        }
        return root;
    }
};