4ms simple recursive solution in C


  • 1
    I
    bool hasPathSum(struct TreeNode* root, int sum) {
        if (root == NULL) return false;
    
        if (root->val == sum && root->left == NULL && root->right == NULL) {
            return true;
        }
    
        return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
    }

Log in to reply
 

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