题目描述
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
import java.util.*;
/*
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>> ans=new ArrayList<ArrayList<Integer>>();
if(pRoot==null) return ans;
Queue<TreeNode> q=new LinkedList<TreeNode>();
q.offer(pRoot);
while(!q.isEmpty()){
int size=q.size();
ArrayList<Integer> arr=new ArrayList<Integer>();
for(int i=0;i<size;i++){
TreeNode tr=q.poll();
if(tr==null) continue;
arr.add(tr.val);
q.offer(tr.left);
q.offer(tr.right);
}
if(arr.size()>0) ans.add(arr);
}
return ans;
}
}