leetcode-Path Sum

Total Accepted: 76998 Total Submissions: 255687 Difficulty: Easy

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.

/**
 * 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 {
    bool helper(TreeNode *root,int sum){
        if(!root->left&&!root->right){
            if(sum-root->val==0)
                return true;
            return false;    
        }    
        if(root->left &&helper(root->left ,sum-root->val))
            return true;
        if(root->right&&helper(root->right,sum-root->val))
            return true;
        return false;
    }
public:
    bool hasPathSum(TreeNode* root, int sum) {
        if(!root)
            return false;
        return helper(root,sum);    
    }
};