LeetCode-Path Sum

</pre><pre name="code" class="cpp">/**
 * Definition for binary tree
 * 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)
{
    if(root==NULL)
        return false;
    if(root->left==NULL && root->right==NULL && sum-root->val==0)
        return true;
    return hasPathSum(root->left, sum-root->val) || hasPathSum(root->right, sum-root->val);
}