Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where each path's sum equals targetSum.
Return the paths in any order; each path lists its values from the root down to the leaf.
[0, 5000].-1000 ≤ Node.val ≤ 1000-1000 ≤ target ≤ 1000DFS with a path list; on a matching leaf, snapshot the path.