Practice Sum Root to Leaf Numbers
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in the tree represents a number. Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer. A leaf node is a node with no children.
Source: Sum Root to Leaf Numbers on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
root = [1,2,3]
Output
25
# Example 2
Input
root = [4,9,0,5,1]
Output
1026
Constraints
The number of nodes in the tree is in the range [1, 1000].
0 <= Node.val <= 9
The depth of the tree will not exceed 10.
Related LeetCode Problems
Practice more problems similar to Sum Root to Leaf Numbers.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.