Tree:从上到下按层打印二叉树，同一层结点从左至右输出。每一层

ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
        
        ArrayList<ArrayList<Integer>> arrayLists = new ArrayList<ArrayList<Integer>>();
        if (pRoot==null) {
            return arrayLists;
        }
        Queue<TreeNode> queue = new LinkedList<TreeNode>();
        queue.add(pRoot);
        while (!queue.isEmpty()) {
            ArrayList<Integer> arrayList = new ArrayList<Integer>();
            int count = queue.size();
            for (int i = 0; i < count; i++) {
                if (queue.peek().left!=null) {
                    queue.add(queue.peek().left);
                }
                if (queue.peek().right!=null) {
                    queue.add(queue.peek().right);
                }
                arrayList.add(queue.poll().val);
            }
            arrayLists.add(arrayList);
        }
        return arrayLists;
    }