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.
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
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
Show hint
Use recursion: subtract current node value from targetSum. If at leaf and targetSum is 0, return true. Otherwise recursively check left and right subtrees.
Sign in to submit, save progress and mark problems as solved. You can still run your code.
Loading editor...
root =
[5,4,8,11,null,13,4,7,2,null,null,null,1]
targetSum =
22
Expected
true