Share my c codes


  • 1
    K

    bool hasPathSum(struct TreeNode* root, int sum) {

    if (root == NULL)
        return false;
        
    if (root->left == NULL && root->right == NULL && root->val == sum)
        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.