Explore each root-to-leaf path using depth-first search. Maintain a running list of node values and the remaining sum.

Path Sum II

medium

Acceptance: 50%

Binary Tree

Given a binary tree and a target sum, enumerate all paths from the root to a leaf where the node values along the path add up exactly to the target. Return each qualifying path as a list of node values.

Examples

Example 1:

Input:root = [10,5,15,3,7,null,20], targetSum = 18

Output:[[10,5,3]]

Example 2:

Input:root = [1,2,3], targetSum = 3

Output:[[1,2]]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Path Sum II

Examples

Hints

Related Problems