LeetCode 637. 二叉树的层平均值

最新推荐文章于 2024-10-16 15:56:33 发布

nuita

最新推荐文章于 2024-10-16 15:56:33 发布

阅读量107

点赞数

文章标签：二叉树层次遍历平均值广度优先搜索数据结构

本文链接：https://blog.csdn.net/qq_25155231/article/details/127446422

版权

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