leetcode112. 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.
Note: A leaf is a node with no children.
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.

方法：递归：
终止条件 sum1=root->val;
否则左右子树分别深度优先搜索，有符合就返回true

class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        if(!root) return false;
        int sum1=root->val;
        if(sum1==sum && !root->left && !root->right)
            return true;
        return hasPathSum(root->left,sum-sum1) || hasPathSum(root->right,sum-sum1);//sum-sum1指原来的sum-当前的结点的值
    }
};