Practice Path Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Path Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
Output
true
# Example 2
Input
root = [1,2,3], targetSum = 5
Output
false
# Example 3
Input
root = [], targetSum = 0
Output
false
Constraints
The number of nodes in the tree is in the range [0, 5000].
-1000 <= Node.val <= 1000
-1000 <= targetSum <= 1000
Related LeetCode Problems
Practice more problems similar to Path Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.