【LeetCode】637 Average of Levels in Binary Tree

问题描述

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

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].

思路

很简单的一道题，只需要进行BFS，求出每一层数字的和及它们的size相除即可得到结果。
唯一需要注意的是计算和的时候需要用long int类型，避免和太大溢出。

代码

class Solution {
public:
    vector<double> averageOfLevels(TreeNode* root) {
        vector<double> result;
        queue<TreeNode*> q;
        q.push(root);
        int size = 0;
        long int sum;
        TreeNode* temp;
        while (!q.empty()) {
            int size = q.size();
            sum = 0;
            int n = size;
            while(n--) {
                temp = q.front();
                sum += temp->val;
                if (temp->left)
                    q.push(temp->left);
                if (temp->right)
                    q.push(temp->right);
                q.pop();
            }
            result.push_back((double)sum / size);
        }
        return result;
    }
};