问题原文https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/description/
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> res = new LinkedList<>();
if(root == null) return res;
Queue<Node> queue = new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()) {
int levelNum = queue.size();
List<Integer> tmp = new LinkedList<>();
for(int i = 0;i < levelNum;i++) {
if(queue.peek().children.size()>0) {
for(Node ele:queue.peek().children) queue.add(ele);
}
tmp.add(queue.poll().val);
}
res.add(tmp);
}
return res;
}