bool hasPathSum(TreeNode *root, int sum) {

if (!root) return false;

if (!root->left and !root->right and sum - root->val == 0) return true;

if(hasPathSum(root->left, sum - root->val)) {

return true;

}

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

}