题目:
有一棵二叉树,请设计一个算法,按照层次打印这棵二叉树。给定二叉树的根结点root,请返回打印结果,结果按照每一层一个数组进行储存,所有数组的顺序按照层数从上往下,且每一层的数组内元素按照从左往右排列。保证结点数小于等于500。
解析:
代码:
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
TreeNode last, nlast;
Vector<Vector<Integer>> vec = new Vector<Vector<Integer>>();
if (root == null){
return null;
}
last = nlast = root;
LinkedList<TreeNode> queue = new LinkedList<TreeNode>();
queue.add(root);
TreeNode node = null;
Vector<Integer> v = new Vector<Integer>();
while(!queue.isEmpty()){
node = queue.poll();
if(null != node.left){
nlast = node.left;
queue.add(node.left);
}
if(null != node.right){
nlast = node.right;
queue.add(node.right);
}
v.add(node.val);
if(node == last){
last = nlast;
vec.addElement(v);
v = new Vector<Integer>();
}
}
int[][] result = new int[vec.size()][];
int len;
for(int i =0; i < vec.size(); i++){
len = vec.get(i).size();
result[i] = new int[len];
for(int j = 0; j < len; j++)
result[i][j] = vec.get(i).get(j);
}
return result;
}
}