leetcode 112 Path Sum（难易度：Easy）

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.

代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
bool hasPathSum(struct TreeNode* root, int sum) {
    if (root == NULL)
		return false;
	if (root->left == NULL && root->right == NULL) {	//是叶子节点
		if (root->val == sum)
			return true;
		else
			return false;
	}
	bool left = hasPathSum(root->left, sum - root->val);
	bool right = hasPathSum(root->right, sum - root->val);
	
	return left || right;
}

原题地址： https://leetcode.com/problems/path-sum/