leetcode 102. 二叉树的层序遍历
采用队列,注意用一个变量currentSize,存储当前层节点的数量,来把同一层的节点放到同一个list里面。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> levelOrder(TreeNode root) {
Deque<TreeNode> deque=new LinkedList<>();
List<List<Integer>> res=new ArrayList<>();
if(root==null){
return res;
}
deque.offerLast(root);
while(!deque.isEmpty()){
int currentSize=deque.size();
List<Integer> t=new ArrayList<>();
for(int i=0;i<currentSize;i++){
TreeNode node=(deque.pollFirst());
if(node.left!=null){
deque.offerLast(node.left);
}
if(node.right!=null){
deque.offerLast(node.right);
}
t.add(node.val);
}
res.add(t);
}
return res;
}
}