Skip to content

problem11.md

Latest commit

 

History

History
12 lines (9 loc) · 502 Bytes

problem11.md

File metadata and controls

12 lines (9 loc) · 502 Bytes

Problem 11: Path Manifest

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, not node references.

Input Format

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