429. N 叉树的层序遍历https://leetcode.cn/problems/n-ary-tree-level-order-traversal/
难度中等288
给定一个 N 叉树,返回其节点值的层序遍历。(即从左到右,逐层遍历)。
树的序列化输入是用层序遍历,每组子节点都由 null 值分隔(参见示例)。
示例 1:
输入:root = [1,null,3,2,4,null,5,6] 输出:[[1],[3,2,4],[5,6]]
示例 2:
输入:root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14] 输出:[[1],[2,3,4,5],[6,7,8,9,10],[11,12,13],[14]]
提示:
- 树的高度不会超过
1000
- 树的节点总数在
[0, 10^4]
之间
通过次数117,960提交次数163,902
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, List<Node> _children) {
val = _val;
children = _children;
}
};
*/
class Solution {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> ans = new ArrayList<List<Integer>>();
if(root==null) return ans;
Queue<Node> queue = new LinkedList<Node>();
queue.offer(root);
while(!queue.isEmpty())
{
int size = queue.size();
List<Integer> list = new ArrayList<Integer>();
while(size>0)
{
Node temp = queue.poll();
list.add(temp.val);
for(Node t: temp.children)
{
if(t!=null) queue.offer(t);
}
size--;
}
ans.add(list);
}
return ans;
}
}