Path Sum

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.

This is a typical dfs problem. the edge case is that if root.val == sum&&root.left == null&& root.right == null then we can find a path that adding up all the values along it equals the given sum. if we traverse a path along and reach the null node, we concludes that the path is not valid.  If all the paths are not valid, return false.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if (root == null)
            return false;
        
        return helper(root, sum);
    }
    
    private boolean helper(TreeNode root, int sum) {
        
        if (root == null)
            return false;
            
            
        if (root.val == sum && root.left == null && root.right == null)
            return true;
            
        return helper(root.left, sum - root.val) || helper(root.right, sum - root.val);
    }
}