leetcode题235. Lowest Common Ancestor of a Binary Search Tree

class Solution {
public:
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        //对于二叉搜索树，根节点一定小于较小的值而大于较大的值
        //因此如果两个节点大于根节点，则两个节点在右边；如果两个节点小于根节点，则两个节点在左边，
        //否则在两边，最小公共节点即为根节点
        if(p->val > root->val && q->val > root->val) return lowestCommonAncestor(root->right,p,q);
        if(p->val < root->val && q->val < root->val) return lowestCommonAncestor(root->left,p,q);
        return root;
        
    }
};