# N-ary Tree Level Order Traversal

Easy

Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example, given a`3-ary`tree:

We should return its level order traversal:

``````[
[1],
[3,2,4],
[5,6]
]
``````

Note:

1. The depth of the tree is at most `1000`.
2. The total number of nodes is at most `5000`.

## Solution

``````/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;

public Node() {}

public Node(int _val,List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> res = new ArrayList<>();
if (root == null) {
return res;
}

q.offer(root);
while (!q.isEmpty()) {
int levelSize = q.size();
ArrayList<Integer> level = new ArrayList<>();
for (int i = 0; i < levelSize; i++) {
Node node = q.poll();
if (node.children != null) {
for (Node c: node.children) {
q.offer(c);
}
}
}
}

return res;
}
}
``````