/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool hasPathSum(TreeNode* root, int sum) {
bool res = false;
if (root){
if (root->left == NULL && root->right == NULL) if (root->val == sum) return true;
res = hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);
}
return res;
}
};