1.题目描述:
给定一个N叉树,返回其节点值的层序遍历。(即从左到右,逐层遍历)。树的序列化输入是用层序遍历,每组子节点都由null值分隔(参见示例)。
2.层序遍历:
/*
// 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>> resList = new ArrayList<>();
Queue<Node> queue = new LinkedList<>();
if (root == null) return resList;
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
List<Integer> list = new ArrayList<>();
while (size > 0) {
Node temp = queue.poll();
size--;
list.add(temp.val);
if (temp.children != null) {
for (int i = 0; i < temp.children.size(); i++) {
queue.add(temp.children.get(i));
}
}
}
resList.add(list);
}
return resList;
}
}