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:
AmazonMicrosoftDE ShawDeloitte
Topics:
Tree
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.
Access Restricted: Please Login to access the code editor and test cases.