试题:
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
代码:
宽度优先搜索
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.*;
public class Solution {
ArrayList<ArrayList<Integer> > Print(TreeNode pRoot) {
ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
Queue<TreeNode> que = new LinkedList<TreeNode>();
que.offer(pRoot);
if(pRoot==null) return res;
while(!que.isEmpty()){
ArrayList<Integer> tmp = new ArrayList<>();
int size = que.size();
for(int i=0; i<size; i++){
TreeNode node = que.poll();
tmp.add(node.val);
if(node.left!=null){
que.offer(node.left);
}
if(node.right!=null){
que.offer(node.right);
}
}
res.add(tmp);
}
return res;
}
}