原题目:https://leetcode-cn.com/problems/lowest-common-ancestor-of-a-binary-search-tree/
思路:
利用二叉搜索树的性质
代码:
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(root->val > p->val && root->val > q->val)
return lowestCommonAncestor(root->left,p,q);
if(root->val < p->val && root->val < q->val)
return lowestCommonAncestor(root->right,p,q);
return root;
}
};