二叉树的层次遍历也叫广度优先遍历,用队列来实现:
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<List<Integer>> levelOrderBottom(TreeNode root) {
List<List<Integer>> result=new LinkedList<>(); //结果集
Queue<TreeNode> queue=new LinkedList<>(); //队列
if(root==null) return result;
//把根节点放进去队列
queue.offer(root);
//遍历队列
while(!queue.isEmpty()){
List<Integer> list=new LinkedList<>(); //存放某一层的数据
//开始遍历队列
int size=queue.size();
for(int i=0;i<size;i++){
TreeNode temp=queue.poll();
if(temp!=null){
list.add(temp.val);
queue.offer(temp.left);
queue.offer(temp.right);
}
}
if(list.size()>0){
result.add(0,list);
}
}
return result;
}
}