题目描述
从上到下,从左到右遍历树。层次遍历
剑指offer 32-1
题目分析
- 用队列,Queue是接口,其实现类是LinkedList;
- 将结果添加到列表忠,但是最后需要转换为数组;
- 需要考虑root为空的特殊情况。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
//层次遍历
class Solution {
public int[] levelOrder(TreeNode root) {
if(root == null){
return new int[0];
}
Queue<TreeNode> queue = new LinkedList<>();
ArrayList<Integer> result = new ArrayList<>();
queue.offer(root);
while(!queue.isEmpty()){
int len = queue.size();
for(int i = 0; i < len; i++){
TreeNode headNode = queue.peek();
result.add(headNode.val);
queue.poll();
i++;
if(headNode.left != null){
queue.offer(headNode.left);
}
if(headNode.right != null){
queue.offer(headNode.right);
}
}
}
int[] res = new int[result.size()];
int index = 0;
for(int num : result){
res[index++] = num;
}
return res;
}
}