ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        if(pRoot==null) return new ArrayList<>();
        TreeNode last=pRoot;
           TreeNode nlast=null;
       LinkedList<TreeNode> queue=new LinkedList<TreeNode>();
        ArrayList<Integer> temp=new ArrayList<Integer>();
        ArrayList<ArrayList<Integer>> res=new ArrayList<ArrayList<Integer>>();
        queue.add(pRoot);
        while(!queue.isEmpty()){
               TreeNode cur=queue.poll();
            temp.add(cur.val);
            if(cur.left!=null){
                queue.add(cur.left);
                nlast=cur.left;
            }
            if(cur.right!=null){
                queue.add(cur.right);
                nlast=cur.right;
            }
            if(cur==last){
                res.add(temp);
                temp=new ArrayList<Integer>();
                last=nlast;
            }
        }
        return res;
    }