Function dfs

graphs/sum-of-distances-in-tree.js:40–51

(cur, parent, depth, adjList, treeInfo, count)

}

function dfs(cur, parent, depth, adjList, treeInfo, count) {
  let sum = 1;

  for (const child of adjList[cur]) {
    if (child !== parent) {
      sum += dfs(child, cur, depth + 1, adjList, treeInfo, count);
      treeInfo.root += depth + 1;
    }
  }
  count[cur] = sum;
  return sum;
}

function createAdjacencyList(n, edges) {
  const list = {};