Solution: Path Sum
Explore how to determine if a binary tree has a root to leaf path with a sum matching a target value. This lesson guides you through using depth first search with recursion to traverse nodes, subtract values from the target sum, and check for valid paths. You will understand the time and space complexity of the approach and how to apply it effectively in coding interviews.
We'll cover the following...
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
. ...