Search⌘ K
AI Features

Solution: Path Sum

Solution: Path Sum asks whether a binary tree contains a root-to-leaf path whose node values add up to a given target sum, including paths with negative values. Return true or false.

Statement

Given the root of a binary tree and an integer targetSum, determine whether there exists a root to leaf path in the tree such that the sum of all node values along the path equals targetSum. Return TRUE if such a path exists, and FALSE otherwise.

Note: A leaf is defined as a node that has no left or right children.

Constraints:

  • The number of nodes in the tree is in the range [0,5000][0, 5000].

  • ...