Sum of Root To Leaf Binary Numbers
Easy
Topics
Every node has value 0 or 1. Each root-to-leaf path represents a binary number (most significant bit first). Return the sum, in base 10, of all root-to-leaf binary numbers.
Example 1
Input: root = [1,0,1,0,1,0,1] Output: 22
Example 2
Input: root = [1,1] Output: 3
Constraints
- 1 <= number of nodes <= 1000
- Node.val is 0 or 1
Run ⌘' · Submit ⌘⏎