import java.util.ArrayList;
import java.util.*;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> result=new ArrayList<>();
if(pRoot==null){
return result;
}
Queue<TreeNode> layer =new LinkedList<TreeNode>();
layer.add(pRoot);
ArrayList<Integer> layerlist= new ArrayList<Integer>();
int i=0;int count=1;
while(!layer.isEmpty()){
TreeNode cur=layer.remove();
layerlist.add(cur.val);
i++;
if(cur.left!=null){
layer.add(cur.left);
}
if(cur.right!=null){
layer.add(cur.right);
}
if(i==count){
count=layer.size();
i=0;
result.add(layerlist);
layerlist=new ArrayList<Integer>();
}
}
return result;
}
}