Leetcode 129. Sum Root to Leaf Numbers
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.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early October, 2025
Meta
Mid-level
Mid September, 2025
Meta
Senior
Mid September, 2025
Meta
Principal
Your account is free and you can post anonymously if you choose.