Back to course home

0% completed

# Solution: Binary Tree Path Sum

## Problem Statement

Given a binary tree and a number ‘S’, find if the tree has a path from root-to-leaf such that the sum of all the node values of that path equals ‘S’.

**Constraints:**

- The number of nodes in the tree is in the range
`[0, 5000]`

. `-1000 <= Node.val <= 1000`

`-1000 <= targetSum <= 1000`

## Solution

As we are trying to search for a root-to-leaf path, we can use the **Depth First Search (DFS)** technique to solve this problem.

.....

.....

.....

Like the course? Get enrolled and start learning!