把二叉树打印成多行 java

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

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>> arrayLists = new ArrayList<>();
        if (pRoot == null) {
            return arrayLists;
        }
        LeverTreeNode copyRoot = copyTreeNode(pRoot);
        Queue<LeverTreeNode> q = new LinkedList<>();
        copyRoot.lever = 1;
        q.add(copyRoot);
        ArrayList<Integer> temp = null;
        while(!q.isEmpty()) {
            LeverTreeNode nowTreeNode = q.peek();
            q.poll();
            if (arrayLists.size()>=nowTreeNode.lever) {
                // 如果不是下一层，就添加到后面
                temp = arrayLists.get(nowTreeNode.lever-1);
                temp.add(nowTreeNode.val);
            } else {
                // 如果是新的一层，就增加
                temp = new ArrayList<>();
                temp.add(nowTreeNode.val);
                arrayLists.add(temp);
            }
            if (nowTreeNode.left!=null) {
                nowTreeNode.left.lever = nowTreeNode.lever+1;
                q.add(nowTreeNode.left);
            }
            if (nowTreeNode.right!=null) {
                nowTreeNode.right.lever = nowTreeNode.lever+1;
                q.add(nowTreeNode.right);
            }
        }
        return arrayLists;
    
    }
    public LeverTreeNode copyTreeNode(TreeNode root) {
        LeverTreeNode copyRoot = null;
        if (root != null) {
            copyRoot = new LeverTreeNode(root.val);
            copyRoot.left = copyTreeNode(root.left);

            copyRoot.right = copyTreeNode(root.right);
        }
        return copyRoot;
    }
    
    
}
class LeverTreeNode {
    int val = 0;
    int lever = 0;
    LeverTreeNode left = null;
    LeverTreeNode right = null;

    public LeverTreeNode(int val) {
        this.val = val;
    }
}