Binary Tree Challenge - 22-09-2023

BinaryTree.js

function leftmostNodesSum(array) {
  let sum = 0;
  let index = 0;

  while (index < array.length && array[index] !== 0) {
    sum += array[index];
    index = 2 * index + 1; 
  }

  return sum;
}

console.log(leftmostNodesSum([2, 7, 5, 2, 6, 0, 9]))
// => 11

module.exports = leftmostNodesSum