LeetCode: 637 Average of Levels in Binary Tree

原创于 2019-04-17 14:23:24 发布 · 113 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode学习笔记专栏收录该内容

30 篇文章

订阅专栏

本文介绍了一种算法，用于计算二叉树各层级节点的平均值，并通过队列实现。示例输入为特定二叉树结构，输出为各层级平均值数组。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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.

代码：

使用队列的先进先出的特点：

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