因为二叉搜索树满足如下条件:root->left的值要小于root->val root->right的值要大于root->val
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if(!root) return NULL;
if(p->val < root->val && q->val < root->val)
{
return lowestCommonAncestor(root->left, p, q);
}
else if(p->val > root->val && q->val > root->val)
{
return lowestCommonAncestor(root->right, p, q);
}
else return root;
}
};