Leetcode 1022. Sum of Root To Leaf Binary Numbers

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1022. Sum of Root To Leaf Binary Numbers

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact