My concise c++ solution


  • 1
    B

    class Solution {
    public:

    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        int max = p->val > q->val ? p->val: q->val;
        int min = p->val < q->val ? p->val: q->val;
        
        if(root->val > max)
        {
            return lowestCommonAncestor(root -> left, p, q);
        }
        
        if(root->val < min)
        {
            return lowestCommonAncestor(root -> right, p, q);
        }
        
        return root;
    }
    

    };


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.