Path Sum II
Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node values, not node references.
A root-to-leaf path is a path starting from the root and ending at any leaf node. A leaf is a node with no children.
Example 1
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1Input
root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22Output
[[5,4,11,2],[5,8,4,5]]There are two paths whose sum equals
targetSum: 5 + 4 + 11 + 2 = 22 and 5 + 8 + 4 + 5 = 22.Example 2
1
/ \
2 3Input
root = [1,2,3], targetSum = 5Output
[]No root-to-leaf path has a sum equal to 5.
Constraints
- The number of nodes in the tree is in the range
[0, 5000]. -1000 <= Node.val <= 1000-1000 <= targetSum <= 1000