1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24 | /**
* 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* LCABST(TreeNode* cur, TreeNode* p, TreeNode* q) {
if (cur->val > p->val && cur->val > q->val)
return LCABST(cur->left, p, q);
if (cur->val < p->val && cur->val < q->val)
return LCABST(cur->right, p, q);
return cur;
}
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
return LCABST(root, p, q);
}
};
|