Short C++ solution


  • 1
    G
        TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
            if (root == NULL || root->val == p->val || root->val == q->val ||
                (p->val < root->val && root->val < q->val) ||
                (q->val < root->val && root->val < p->val)) return root;
            else if (root->val < p->val) return lowestCommonAncestor(root->right, p, q);
            else return lowestCommonAncestor(root->left, p, q);
        }
    

Log in to reply
 

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