import java.util.*;
import java.util.List;
import java.util.ArrayList;
/*
* public class TreeNode {
* int val = 0;
* TreeNode left = null;
* TreeNode right = null;
* }
*/
public class Solution {
/**
*
* @param root TreeNode类
* @return int整型ArrayList<ArrayList<>>
*/
public ArrayList<ArrayList<Integer>> levelOrder (TreeNode root) {
// write code here
ArrayList<ArrayList<Integer>> list = new ArrayList<>();
if(root == null) return list;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while(!queue.isEmpty()){
ArrayList<Integer> temp = new ArrayList<>();
int size = queue.size();
for(int i = 0 ;i < size;i++){
TreeNode t = queue.poll();
temp.add(t.val);
TreeNode left = t.left;
TreeNode right = t.right;
if(left != null) {
queue.add(left);
}
if(t.right != null) {
queue.add(right);
}
}
list.add(temp);
}
return list;
}
}