My Clear and Concise C++ Solution


  • 0
    R
    class Solution {
    public:
        TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
            if(!root || root==p || root==q) return root;
            TreeNode * left = lowestCommonAncestor(root->left, p, q);
            TreeNode * right = lowestCommonAncestor(root->right, p, q);
            if(left && right) return root;
            if(!left && !right) return NULL;
            return left != NULL ? left : right;
        }
    };
    

Log in to reply
 

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