algorythms
Tree DFS
LC #113Medium

Path Sum II

Tree DFS
AmazonGoogleMeta

Problem

Return all root-to-leaf paths where the path sum equals target.

treedfsbacktracking

Constraints

  • 0 ≤ n ≤ 5000
  • -1000 ≤ Node.val ≤ 1000
  • -1000 ≤ targetSum ≤ 1000

Example

Inputroot = [5, 4, 8, 11, null, 13, 4, 7, 2, null, null, 5, 1], targetSum = 22
Output[[5,4,11,2],[5,8,4,5]]
Why

Both paths sum to 22

Hints — reveal one at a time