【打卡第228道】【二叉树】【leetCode高频】：637. 二叉树的层平均值

1、题目描述

2、算法分析

还是层次遍历，使用队列获取每一层的结点值。将计算后得结果添加到List集合中。 

3、代码实现

/**
 * 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> result = new ArrayList<>();
        if(root == null){
            return result;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        
        while(!queue.isEmpty()){
            Double sum = 0.0;
            Double count = 0.0;
            int size = queue.size();
            // 遍历每一层
            for(int i = 0;i < size;i++){
                TreeNode node = queue.poll();
                count = count + 1;
                sum = sum + node.val;
                // 后面的每一层添加进去
                if(node.left != null){
                    queue.offer(node.left);
                }
                if(node.right != null){
                    queue.offer(node.right);
                }
            }
            // 每一层添加到结果集中
            result.add(sum / count);
        }
        return result;
    }
}