struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

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

    if(hasPathSum(root->left, sum - root->val))return true;

    return hasPathSum(root->right, sum - root->val);
}