【剑指offer】把二叉树打印成多行

public class  {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;
    
    public (int val) {
        this.val = val;
    }
}

public ArrayList<ArrayList<Integer>> Print(TreeNode pRoot) {
    ArrayList<ArrayList<Integer>> results = new ArrayList<>();

    if (pRoot != null) {
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(pRoot);

        while (!queue.isEmpty()) {
            ArrayList<Integer> result = new ArrayList<>();
            int start = 0;
            int end = queue.size();

            while (start++ < end){
                TreeNode node = queue.poll();
                result.add(node.val);

                if (node.left != null)
                    queue.offer(node.left);

                if (node.right != null)
                    queue.offer(node.right);
            }

            results.add(result);
        }
    }

    return results;
}