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 represent 01101 in binary, which is 13.
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:
Input: root = [1,0,1,0,1,0,1]
Output: 22
Explanation: (100) + (101) + (110) + (111) = 4 + 5 + 6 + 7 = 22
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {number}
*/
var sumRootToLeaf = function (root) {
let sum = 0;
const getAllPaths = (root, currentPath) => {
if (root === null) {
return;
}
currentPath = currentPath + root.val;
if (root.left === null && root.right === null) {
let intValue = parseInt(currentPath, 2);
sum = sum + intValue;
}
if (root.left) {
getAllPaths(root.left, currentPath);
}
if (root.right) {
getAllPaths(root.right, currentPath);
}
};
getAllPaths(root, "");
return sum;
};
Top comments (0)