题目描述
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
解法
配合队列解决,详细解法如下:
import java.util.ArrayList;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.LinkedList;
import java.util.Queue;
public class Solution {
ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> A1 = new ArrayList<ArrayList<Integer>>();
if(pRoot == null){
return A1;
}
Queue<TreeNode> q = new LinkedList<TreeNode>();
q.add(pRoot);
while(!q.isEmpty()){
ArrayList<Integer> A2 = new ArrayList<Integer>();
int length = q.size();
int cur = 0;
while(cur < length){
TreeNode temp = q.poll();
A2.add(temp.val);
if (temp.left != null) {
q.add(temp.left);
}
if (temp.right != null) {
q.add(temp.right);
}
cur++;
}
A1.add(A2);
}
return A1;
}
}