Path Sum
Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.
A leaf is a node with no children.
Example 1
5
/ \
4 8
/ / \
11 13 4
/ \ \
7 2 1Input
root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22Output
trueThe root-to-leaf path with the target sum is shown.
Example 2
1
/ \
2 3Input
root = [1,2,3], targetSum = 5Output
falseThere are two root-to-leaf paths with sums 3 and 4, so there is no root-to-leaf path with sum 5.
Constraints
- The number of nodes in the tree is in the range
[0, 5000]. -1000 <= Node.val <= 1000-1000 <= targetSum <= 1000