Available question text
Given a binary tree with node values 0 or 1, interpret each root-to-leaf path as a binary number (root is the most significant bit) and return the sum of all those numbers. This is a tree-traversal problem (e.g., DFS) that accumulates bit-values along each path; the result fits in a 32-bit integer.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
- Sum Root to Leaf Numbers
Coding
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Binary Searchable Numbers in an Unsorted Array
Coding · Array · Binary Search · Monotonic Stack
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
No company association
Leetcode 1022. Sum of Root To Leaf Binary Numbers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source