剑指Offer-----------把二叉树打印成多行

题目描述

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

把每一层结点存入队列中

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> > a = new ArrayList<>();
        if(pRoot == null) return a;
        Queue<TreeNode> queue =new LinkedList<>();
        queue.offer(pRoot);
        while(!queue.isEmpty()){
            int l = queue.size();
            ArrayList<Integer> list = new ArrayList<>(); 
            for(int i = 0;i < l;i++){ 
                TreeNode node = queue.poll();
                list.add(node.val);
                if(node.left != null) queue.offer(node.left);
                if(node.right != null) queue.offer(node.right);
            }
            a.add(list);
        }
        return a;
    }
    
}