二叉树层序遍历
/**
* 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<Double> averageOfLevels(TreeNode root) {
List<Double> list = new ArrayList();
Deque<TreeNode> queue = new LinkedList<TreeNode>();
if(root != null){
queue.offer(root);
}
while(!queue.isEmpty()){
long sum = 0;
int size = queue.size();
for(int i = 0; i < size; i++){
TreeNode node = queue.poll();
sum += node.val;
if(node.left != null){
queue.offer(node.left);
}
if(node.right != null){
queue.offer(node.right);
}
}
list.add((double)sum / size);
}
return list;
}
}