Path Sum

Easy

treebinary-treedfs

Given a binary tree and an integer targetSum, return true if some root-to-leaf path sums to targetSum.

Input

Output: true or false.

Example 1

Input:

5 4 8 11 null 13 4 7 2 null null null 1
22

Output:

true

5+4+11+2 = 22.

Example 2

Input:

1 2 3
5

Output:

false

Example 3

Input:

null
0

Output:

false

Run your code against the sample tests, or Submit to run the full suite.

Easy

treebinary-treedfs

Given a binary tree and an integer targetSum, return true if some root-to-leaf path sums to targetSum.

Input

Output: true or false.

Example 1

Input:

5 4 8 11 null 13 4 7 2 null null null 1
22

Output:

true

5+4+11+2 = 22.

Example 2

Input:

1 2 3
5

Output:

false

Example 3

Input:

null
0

Output:

false

Run your code against the sample tests, or Submit to run the full suite.