【Leetcode】Path Sum (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依次递减，当访问到叶子节点的时候并且叶子节点的val就等于sum的时候，返回true。不然继续遍历直到所有节点全部访问完，返回false。

压栈思路：先左节点全入，和依次递减，然后左出右入。这里只需要用或运算来判断，因为只需要找一条等于sum的路径即可。

代码如下

	public boolean hasPathSum(TreeNode root, int sum) {
		if (root == null)
			return false;
		if (root.left == null && root.right == null && root.val == sum)
			return true;
		boolean left = hasPathSum(root.left, sum - root.val);
		boolean right = hasPathSum(root.right, sum - root.val);
		return left || right;
	}