二叉树的层平均值

题目

题源

代码

class Solution {
    public List<Double> averageOfLevels(TreeNode root) {
        List result = new ArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            double sum = 0.0;
            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);
            }
            double avg = sum / size;
            result.add(avg);

        }
        return result;
    }
}