题目链接:LeetCode235
思路:根据BST的性质可以得到以下逻辑:
当root介于p、q之间时,LCA(T, p, q) == root;
否则LCA要往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) {
if (root == NULL) return NULL;
if (p->val <= root->val && q->val >= root->val ||
p->val >= root->val && q->val <= root->val ) return root;
return p->val <= root->val ? lowestCommonAncestor(root->left, p, q) : lowestCommonAncestor(root->right, p, q);
}
};