public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> ret = new ArrayList<>();
if (pRoot == null) {
return ret;
}
Queue<TreeNode> queue = new LinkedList<TreeNode>();
queue.offer(pRoot);
int count=1;
while (!queue.isEmpty()) {
ArrayList<Integer> level = new ArrayList<Integer>();
int currentLevelSize = queue.size();
for (int i = 0; i <currentLevelSize; i++) {
TreeNode node = queue.poll();
level.add(node.val);
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
if(count%2==0){
level=reverse(level);
}
ret.add(level);
count++;
}
return ret;
}
public ArrayList<Integer> reverse(ArrayList<Integer> level){
ArrayList<Integer> list=new ArrayList<>();
for(int i=level.size()-1;i>=0;i--){
list.add(level.get(i));
}
return list;
}