Function branchSums

binary-trees/branch-sums.js:30–32

(root)

// time O(n) where n is the number of nodes
// space O(n)
function branchSums(root) {
  return branchSumsHelper(root, 0, (sums = []));
}

function branchSumsHelper(root, currentSum, sums) {
  if (root !== null) {