Largest Level of Tree

// assuming the node has the following structure:
class Node {
  constructor(value) {
    this.val = value;
    this.children = [];
  }

  addNode(val) {
    if (typeof val === 'number') {
      this.children.push(new Node(val));
    } else if (val.constructor === Node) {
      this.children.push(val);
    } else {
      throw ('input type must be either number or node');
    }
  }
}

// general strategy:
// traverse down the tree in a level order fashion
// whilst keepting track of the level we are currently scanning through
// keep track of the max sum we have encountered so far
// in the event we come across a sum greater than what is specified by the max
// we over write the max level and the sum associated with it
// we do this until we have exhausted all levels. 
// we return the level on record; 

var findLargestLevel = function(root) {
  var level = 0;
  var maxLevel;
  var maxSum = Number.MIN_VALUE;
  var queue = [root];
  
  while (queue.length) {
    level += 1;
    var curLevelLength = queue.length;
    var curSum = 0;
    while(curLevelLength--) {
      var curNode = queue.shift();
      curSum += curNode.val;
      for (var i = 0; i < curNode.children.length; i++) {
        queue.push(curNode.children[i]);
      }
    }
    if (curSum > maxSum) {
      maxSum = curSum;
      maxLevel = level;
    }
  }

  return maxLevel; 
};