[leetcode] 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:

 

 

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.

代码：

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