LeetCode 112: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.

给定一棵二叉树和一个数，判断该树是否存在一条从根节点到叶节点所有节点的值之和等于该数的路径。

例如：给定sum=22和该树

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

你的程序应当返回true，因为存在一条路径5->4->11->2其路径上所有节点之和为22。

不太难，对于每一个节点，先判断是否为NULL，之后将num减去该节点的值，然后判断该节点是否为叶子节点：如果是，那么判断num是否为0；若不是，那么继续递归

/**
 * 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) {
        if(root==NULL) return false;
        sum-=root->val;
        if(!root->left&&!root->right&&sum==0) return true;
        else return hasPathSum(root->left,sum)|hasPathSum(root->right,sum);
    }
};