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.

/*
#include <iostream>
using namespace std;

struct TreeNode
{
	int data;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x):data(x),left(NULL),right(NULL) {}
};

//题目只要求返回 true 或者 false，因此不需要记录路径。
//由于只需要求出一个结果，因此，当左、右任意一棵子树求到了满意结果，都可以及时 return。
//由于题目没有说节点的数据一定是正整数，必须要走到叶子节点才能判断，因此中途没法剪枝，只能进行朴素深搜。
class solution
{
public:
	bool hasPathSum(TreeNode *root,int sum)
	{
		if(root == NULL) return false;    //节点为空
		if(root->left == NULL&&root->right == NULL) //叶子节点
			return sum == root->data;

		bool l = hasPathSum(root->left,sum - root->data); //左子树查找
		bool r = hasPathSum(root->right,sum - root->data); //右子树查找
		return l||r;
	}
};

//创建一个二叉树  
void buildTree2(TreeNode **T)  
{  
    int ch;  
    cin>>ch;  
    if(ch == 0)  
    {  
        *T = NULL;  
    }  
    else  
    {  
        *T = new TreeNode(ch);  
        printf("请输入%d的左孩子：",ch);  
        buildTree2(&((*T)->left));  
        printf("请输入%d的右孩子：",ch);  
        buildTree2(&((*T)->right));  
    }  
} 

void main()
{
	TreeNode *root;
	buildTree2(&root);

	solution *sol = new solution;
	bool isHasPath = sol->hasPathSum(root,8);
	printf("The path is %s.\n",isHasPath?"True":"False");
	delete sol;
}
*/