Available question text
Given a binary tree whose nodes are digits 0–9, compute the sum of all integers formed by concatenating digits along each root-to-leaf path (e.g., 1→2→3 represents 123); tree size ≤1000 and depth ≤10.
Related questions
Continue with questions that share topics or the same question type.
- Sum of Root To Leaf Binary Numbers
Coding
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
- Consecutive Numbers Sum
Coding · Enumeration · Math
- Find the Minimum Number of Fibonacci Numbers Whose Sum Is K
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 129. Sum Root to Leaf Numbers
Reported Oct 1, 2026 · 19 source reports
MID_LEVEL, PRINCIPAL, SENIOR
Source snapshot: Nov 12, 2026
View source