637. Average of Levels in Binary Tree*

最新推荐文章于 2024-09-30 14:51:11 发布

珍妮的选择

最新推荐文章于 2024-09-30 14:51:11 发布

阅读量176

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/Eric_1993/article/details/104486117

版权

LeetCode 专栏收录该内容

416 篇文章 4 订阅

订阅专栏

637. Average of Levels in Binary Tree*

https://leetcode.com/problems/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.
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:
The range of node’s value is in the range of 32-bit signed integer.

C++ 实现 1

层序遍历.

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