Back to course home

0% completed

# Solution: Sum of Path Numbers

## Problem Statement

Given a binary tree where each node can only have a digit (0-9) value, each root-to-leaf path will represent a number. Find the total sum of all the numbers represented by all paths.

**Constraints:**

- The number of nodes in the tree is in the range
`[1, 1000]`

. `0 <= Node.val <= 9`

- The depth of the tree will not exceed
`10`

.

## Solution

This problem follows the **Binary Tree Path Sum** pattern. We can follow the same **DFS** approach. The additional thing we need to do is to keep track of the number representing the current path.

.....

.....

.....

Like the course? Get enrolled and start learning!