116. Sum Root to Leaf Numbers
MediumTree
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. - For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123. 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.
Examples
Input: [4,9,0,5,1]
Output: 1026
Explanation: 495 + 491 + 40 = 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.
Loading...
Run checks all cases above. Submit evaluates all test cases.