1.题目
有一棵二叉树,请设计一个算法,按照层次打印这棵二叉树。
给定二叉树的根结点root,请返回打印结果,结果按照每一层一个数组进行储存,所有数组的顺序按照层数从上往下,且每一层的数组内元素按照从左往右排列。保证结点数小于等于500。
主要思路:
2.代码:
import java.util.*;
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}*/
public class TreePrinter {
public int[][] printTree(TreeNode root) {
// write code here
ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> list = new ArrayList<Integer>();
if(root == null){
return null;
}
Queue<TreeNode> q = new LinkedList<>();
q.offer(root);
TreeNode last = root;
TreeNode nlast = null;
while(!q.isEmpty()){
TreeNode cur = q.poll();
list.add(cur.val);
if(cur.left != null){
q.offer(cur.left);
nlast = cur.left;
}
if(cur.right != null){
q.offer(cur.right);
nlast = cur.right;
}
if(cur == last){
res.add(list);
list = new ArrayList<>();
last = nlast;
}
}
int[][] result = new int[res.size()][];
for(int i=0; i<res.size();i++){
result[i] = new int[res.get(i).size()];
for (int j = 0; j < result[i].length; j++) {
result[i][j] = res.get(i).get(j);
}
}
return result;
}
}
3.总结
1.二叉树的层序遍历:通过Queue实现。last和nlast的设置;