Binary Tree Path Sum

Question: 

Given a binary tree, find all paths that sum of the nodes in the path equals to a given number target.

A valid path is from root node to any of the leaf nodes.

 

Example:

Given a binary tree, and target = 5:

     1
    / \
   2   4
  / \
 2   3

return

[
  [1, 2, 2],
  [1, 4]
]

 

Analysis:

先序遍历整棵树，用一个变量sum记录从根节点到当前节点的节点数字之和，当遇到叶子节点（节点左右子节点均为空）并且和等于目标target的时候，该条路径就是我们要找的路径，将它加入到list当中。

递归函数helper的定义：在当前节点至叶子节点所有的路径中找出符合条件的路径加入到结果集当中。

 

Code:

public class Solution {
    /**
     * @param root the root of binary tree
     * @param target an integer
     * @return all valid paths
     */
    public List<List<Integer>> binaryTreePathSum(TreeNode root, int target) {
        List<List<Integer>> list = new ArrayList<>();
        List<Integer> path = new ArrayList<Integer>();
        
        if(root == null) {
            return list;
        }
        
        path.add(root.val);
        helper(root, root.val, target, path, list);
        return list;
    }
    
    private void helper(TreeNode root,
                        int sum,
                        int target, 
                        List<Integer> path, 
                        List<List<Integer>> list) {
        if(root.left == null && root.right == null && sum == target) {
            list.add(new ArrayList<Integer>(path));
            return;
        }
        
        if(root.left != null) {
            path.add(root.left.val);
            helper(root.left, sum + root.left.val, target, path, list);
            path.remove(path.size() - 1);
        }
        
        if(root.right != null) {
            path.add(root.right.val);
            helper(root.right, sum + root.right.val, target, path, list);
            path.remove(path.size() - 1);
        }
    }
}

 

 

Complexity：

时间复杂度为O(n)，n为树中节点的个数。空间复杂度为O(h * 2^(h - 1))，h为树的高度。