- 问题描述
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
- 解决方案
代码如下:
import java.util.ArrayList;
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) {
LinkedList<TreeNode> list = new LinkedList<>();
ArrayList<ArrayList<Integer> > res = new ArrayList<>();
if(pRoot == null)
return res;
list.addLast(pRoot);
while(list.size() > 0){
ArrayList<Integer> temp = new ArrayList<>();
int s = list.size();
for(int i = 0;i < s;i ++){
TreeNode node = list.pollFirst();
if(node.left != null)
list.addLast(node.left);
if(node.right != null)
list.addLast(node.right);
temp.add(node.val);
}
res.add(temp);
}
return res;
}
}