题目:
给定一个 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, 104] 之间
代码:
package dayLeetCode;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;
public class dayleetcode429 {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> ansList = new ArrayList<>();
if (root == null){
return ansList;
}
Queue<Node> queue = new ArrayDeque<>();
queue.offer(root);
while (queue.isEmpty() == false){
List<Integer> tmpLevel = new ArrayList<>();
int cnt = queue.size();
for (int i = 0; i < cnt; i++){
Node tmpNode = queue.poll();
tmpLevel.add(tmpNode.val);
for (Node child : tmpNode.children) {
queue.offer(child);
}
}
ansList.add(tmpLevel);
}
return ansList;
}
}
// 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;
}
}