Problem Submissions Solution

Tree Path Sum

Difficulty: Medium

Acceptance: %

Points: 30.00

Given the root of a binary tree and an integer targetSum, return the count of root-to-leaf paths where the sum of the node values in the path equals targetSum.

A root-to-leaf path is a path starting from the root and ending at any leaf node. A leaf is a node with no children.

Topics

Companies

Articles

Examples:

Expected Time Complexity: O(n)

Expected Auxiliary Space: O(log n) for recursive calls.

Constraints:
  • The number of nodes in the tree is in the range [0, 5000].
  • -1000 <= Node.val <= 1000
  • -1000 <= targetSum <= 1000
Companies:
Amazon Microsoft DE Shaw Deloitte
Topics:
Tree
Locked Content
Access Restricted: Please Login to access the code editor and test cases.