const bfs = (lev=[], prolific) => {
  if(!lev.length) return prolific;
  const n = lev.shift();
  if(!prolific || prolific.children.length > n.children.length)
    prolific = n;
  return bfs(lev.concat(n.children));
}