按层打印二叉树

解题思路：需要一个queue暂时存放TreeNode等待处理，用nLast记录当前层当时最右节点，last记录当前层实际最右节点，cur是当前节点，如果当前节点就是最右节点，就把nLast当前最右节点赋值给last，curLine用于存储每一层节点数据，当是当前节点是该层最右节点，就把该层的curLine添加到nodes，然后创建新的curLine来装下一层节点数据

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
/*
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>> nodes = new ArrayList<>();
     if(pRoot==null)
           return nodes;

        ArrayList<Integer> curLine = new ArrayList<>();
        TreeNode cur, last = pRoot, nLast = null;


        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(pRoot);
        while(!queue.isEmpty()){
            cur=queue.poll();
            curLine.add(cur.val);
            if(cur.left!=null){
                queue.offer(cur.left);
                nLast=cur.left;
            }
            if(cur.right!=null){
                queue.offer(cur.right);
                nLast=cur.right;
            }
            if(cur==last){
                nodes.add(curLine);
                last=nLast;
                curLine=new ArrayList<>();
            }
        }
        return nodes;
    }

}