Sum of Root To Leaf Binary Numbers
You are given the root of a binary tree where each node has a value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit.
- For example, if the path is
0 -> 1 -> 1 -> 0 -> 1, then this could represent01101in binary, which is13.
For all leaves in the tree, consider the numbers represented by the path from the root to that leaf. Return the sum of these numbers.
The test cases are generated so that the answer fits in a 32-bits integer.
Example 1
1
/ \
0 1
/ \ / \
0 1 0 1Input
root = [1,0,1,0,1,0,1]Output
22The root-to-leaf paths represent binary numbers 100, 101, 110, and 111, whose values sum to 22.
Example 2
0
Input
root = [0]Output
0The only root-to-leaf path represents binary number 0.
Constraints
- The number of nodes in the tree is in the range
[1, 1000]. Node.valis0or1.