题目:
给定一个非空二叉树, 返回一个由每层节点平均值组成的数组。
最终代码:
/**
* 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 {
List<Double> list=new ArrayList<>();
public List<Double> averageOfLevels(TreeNode root) {
dfs(root);
return list;
}
public void dfs(TreeNode root){
Queue<TreeNode> queue=new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
double sum=0;
int len=queue.size();
for(int i=queue.size()-1;i>=0;i--){
TreeNode temp=queue.poll();
sum=temp.val+sum;
if(temp.left!=null){
queue.add(temp.left);
}
if(temp.right!=null){
queue.add(temp.right);
}
}
double avg=(double)sum/len;
list.add(avg);
}
}
}