剑指offer编程试题Java实现--60.把二叉树打印成多行

个人博客：小景哥哥

60.把二叉树打印成多行

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

import java.util.ArrayList;
import java.util.Queue;
import java.util.LinkedList;


public class TreeNode {
    int val = 0;
    TreeNode left = null;
    TreeNode right = null;

    public TreeNode(int val) {
        this.val = val;

    }

}

public class Solution {
    public ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
         ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();
         if(pRoot == null)
             return list;
         Queue<TreeNode> q = new LinkedList<TreeNode>();
         q.add(pRoot);
         while(!q.isEmpty()) {
             int l = 0, h = q.size();
             ArrayList<Integer> temp = new ArrayList<>();
             while(l++ < h) {
                 TreeNode tn = q.poll();
                 temp.add(tn.val);
                 if(tn.left != null)
                     q.add(tn.left);
                 if(tn.right != null)
                     q.add(tn.right);
             }
             list.add(temp);
         }
         return list;
     }

}