99. Path Sum

EasyTree

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.

Examples

Input: [5,4,8,11,null,13,4,7,2,null,null,null,1] 22

Output: true

Explanation: The path 5->4->11->2 sums to 22.

Constraints

  • The number of nodes in the tree is in the range [0, 5000].
  • -1000 <= Node.val <= 1000
  • -1000 <= targetSum <= 1000
Loading...

Run checks all cases above. Submit evaluates all test cases.