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.

30:00

Path Sum II
medium
Topics
Companies

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.

Example 1:
Input: {"root":[5,4,8,11,null,13,4,7,2,null,null,5,1],"targetSum":22}
Output: [[5,4,11,2],[5,8,4,5]]
Constraints:

  • The number of nodes is in the range [0,5000][0, 5000].

  • −1000≤Node.val≤1000-1000 \leq \text{Node.val} \leq 1000

  • −1000≤targetSum≤1000-1000 \leq \text{targetSum} \leq 1000

Input
arr ={"root":[5,4,8,11,null,13,4,7,2,null,null,5,1],"targetSum":22}
Target
22

5

4

8

11

13

4

7

2

5

1

Variables
VariableValue
remSum22
path[5]
DepthFunction Call
0dfsnode=5, rem=22
0/34