Simple recursive solution in C++ (no helper func needed)


  • 9
    G
    TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
        if(root == NULL){
            return NULL;
        }
        if(root == p || root == q)
        {
            return root;
        }
        
        TreeNode* left = lowestCommonAncestor(root->left, p, q);
        TreeNode* right = lowestCommonAncestor(root->right, p, q);
    
        if(left != NULL && right != NULL)
        {
            return root;
        }
        else if(left == NULL && right == NULL)
        {
            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.