Leetcode Path Sum

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:

Given the below binary tree and sum = 22,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path  5->4->11->2  which sum is 22

<span style="font-size:14px;">/**
 * 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) {
        return dfs(root,sum,0);
    }
    bool dfs(TreeNode* node,int sum,int temp)
    {
        if(node==NULL)
            return false;
        if(node->left==NULL&&node->right==NULL)
        {
            if (temp + node->val == sum)
                return true;
            else return false;
        }
        dfs(node->left,sum,temp + node->val)||dfs(node->right,sum,temp + node->val);
    }
};</span>