Largest Tree

gistfile1.txt

const findLargestLevel = function(n) {

  //first create a holder var
  const allNodes = [];
    // define our recursive foo (node, depth)
    function checkNodes (node, depth) {
     // first add the value of the node to its current depth (in the array)
      if (!allNodes[depth]) {
        allNodes[depth] = 0;
      }
      allNodes[depth] += node.value
     // if the node has children, loop over them and recursibly apply the foo
      node.children.forEach(child => {
        // increase the depth by 1
        checkNodes(child, depth + 1);
      }) 
        
    }

  checkNodes(n, 0);

  return allNodes.indexOf(Math.max(...allNodes));

};