有一棵二叉树,请设计一个算法,按照层次打印这棵二叉树。
给定二叉树的根结点root,请返回打印结果,结果按照每一层一个数组进行储存,所有数组的顺序按照层数从上往下,且每一层的数组内元素按照从左往右排列。保证结点数小于等于500。
import java.util.*;
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
public class TreePrinter {
public static int[][] printTree(TreeNode root) {
// write code here
if(root == null){
return null;
}
LinkedList<TreeNode> link = new LinkedList<TreeNode>();
ArrayList<ArrayList<Integer>> level = new ArrayList<ArrayList<Integer>>();
ArrayList<Integer> arr = new ArrayList<Integer>();
TreeNode last = root;
TreeNode nlast = null;
link.add(last);
while(!link.isEmpty()){
TreeNode tem= link.removeFirst();
arr.add(tem.val);
if(tem.left!=null){
link.add(tem.left);
nlast=tem.left;
}
if(tem.right!=null){
link.add(tem.right);
nlast=tem.right;
}
if(tem==last){
level.add(arr);
arr=new ArrayList<Integer>();
last=nlast;
}
}
int[][] num = new int[level.size()][];
for(int i=0;i<level.size();i++){
num[i] = new int[level.get(i).size()];
for(int j=0;j<level.get(i).size();j++){
num[i][j]=level.get(i).get(j);
System.out.print(num[i][j]+" ");
}
System.out.println();
}
return num;
}
public static void main(String[] args){
TreeNode root = new TreeNode(1);
root.left = new TreeNode(2);
root.right=new TreeNode(4);
root.left.right = new TreeNode(5);
root.left.right.left = new TreeNode(4);
root.left.right.right = new TreeNode(9);
int[][] result = printTree(root);
}
}