牛客网 | 把二叉树打印成多行

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

和上一篇文章类似，只是不需要进行翻转Arraylist

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 {
    public static ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
        ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
        if(pRoot==null) return lists;
        Queue<TreeNode> queue = new LinkedList<>();
        ArrayList<Integer> list = new ArrayList<>();
        queue.add(pRoot);
        int start = 0;
        int end = 1;
        while(!queue.isEmpty())
        {
            TreeNode node = queue.poll();
            list.add(node.val);
            if(node.left!=null)     queue.add(node.left);
            if(node.right!=null)    queue.add(node.right);
            start++;
            if(start==end)
            {
                end = queue.size();
                start = 0;
                lists.add(list);
                list = new ArrayList<>();
            }
        }
        return lists;
    }
    
}