从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
方法:
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 {
ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> lists=new ArrayList<ArrayList<Integer>>();
Queue<TreeNode> queue=new LinkedList<TreeNode>();
if(pRoot==null)
return lists;
queue.add(pRoot);
while(!queue.isEmpty()){
int count=queue.size();
ArrayList<Integer> list=new ArrayList<Integer>();
while(count>0){
TreeNode temp=queue.poll();
list.add(temp.val);
if(temp.left!=null)
queue.add(temp.left);
if(temp.right!=null)
queue.add(temp.right);
count--;
}
lists.add(list);
}
return lists;
}
}