429. N-ary Tree Level Order Traversal

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:

/*
// 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<List<Integer>>();
    if(root==null){
        return res;
    }
    Queue<Node> queue=new LinkedList<Node>();
    queue.offer(root);
    while(!queue.isEmpty()){
        List<Integer> level=new ArrayList<Integer>();
        int size=queue.size();
        for(int i=0;i<size;i++){
            Node head=queue.poll();
            level.add(head.val);
            if(head.children!=null){
                int levelSize=head.children.size();
                for(int j=0;j<levelSize;j++){
                    queue.offer(head.children.get(j));
                }
            }
        }
        res.add(level);
    }
        return res;
    }
}