235. Lowest Common Ancestor of a Binary Search Tree.cpp

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 )
        {
           return lowestCommonAncestor(root->left,p,q);
        }

        if(p->val>root->val  && q->val>root->val )
        {
           return lowestCommonAncestor(root->right,p,q);
        }

        return root;
        
    }
};