LeetCode 637 Average of Levels in Binary Tree (BFS)

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Example 1:

Input:
    3
   / \
  9  20
    /  \
   15   7
Output: [3, 14.5, 11]
Explanation:
The average value of nodes on level 0 is 3,  on level 1 is 14.5, and on level 2 is 11. Hence return [3, 14.5, 11].

 

Note:

1. The range of node's value is in the range of 32-bit signed integer.

题目链接：https://leetcode.com/problems/average-of-levels-in-binary-tree/

题目分析：BFS，记录每层数字个数

2ms，时间击败98.41%

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Double> averageOfLevels(TreeNode root) {
        List<Double> ans = new ArrayList<>();
        if (root == null) {
            return ans;
        }
        Queue<TreeNode> q = new LinkedList<>();
        q.offer(root);
        while (!q.isEmpty()) {
            int sz = q.size();
            double sum = 0, n = sz * 1.0;
            while (sz > 0) {
                TreeNode cur = q.poll();
                sum += (1.0 * cur.val);
                sz--;
                if (cur.left != null) {
                    q.offer(cur.left);
                }
                if (cur.right != null) {
                    q.offer(cur.right);
                }
            }
            ans.add(sum / n);
        }
        return ans;
    }
}