112. Path Sum

Solution Code

C

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */

bool hasPathSum(struct TreeNode* root, int targetSum) {
    if(root == NULL)
        return false;

    if (root->left == NULL && root->right == NULL) {
        if (root->val == targetSum)
            return true;

        return false;
    }
    
    return (hasPathSum(root->left, targetSum - root->val) || hasPathSum(root->right, targetSum - root->val));
}