Leetcode 113. Path Sum II

Find all root-to-leaf paths in a binary tree whose node values sum to targetSum, returning each path as a list of values. This is solved with DFS/backtracking that accumulates the running sum (note values may be negative and tree size ≤ 5000).