Path Sum 【leetcode】

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值。

昨天想了很多递归的方法来解，但是总是没有太理想。（解题用了很巧妙的递归，“或”运算来判断，只要有一个返回true则为真）

参考： http://www.cnblogs.com/remlostime/archive/2012/11/13/2767746.html

 bool dfs(TreeNode *root, int sum,int cursum){
	 if (root == NULL){
		 return false;
	 }
	 if (root->left == NULL && root->right == NULL){
		 return cursum + root->val == sum;
	 }
	 return (dfs(root->left, sum, cursum+root->val) || dfs(root->right, sum, cursum+root->val));
 }

bool hasPathSum(TreeNode *root, int sum) {
	return dfs(root, sum, 0);
}