Skip to content

problem18.md

Latest commit

 

History

History
12 lines (9 loc) · 474 Bytes

problem18.md

File metadata and controls

12 lines (9 loc) · 474 Bytes

Problem 18: The Target Sum Path (Path Sum II)

Problem Statement

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.

Input Format

  • Root of a binary tree.
  • An integer targetSum.

Example

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]]