LeetCode | 637. Average of Levels in Binary Tree

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

1LOVESJohnny

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

阅读量216

点赞数

分类专栏： LeetCode 文章标签： leetcode C++ 二叉树 binary tree

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/124519669

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

.

题目

Given the root of a binary tree, return the average value of the nodes on each level in the form of an array. Answers within 10-5 of the actual answer will be accepted.

Example 1:

在这里插入图片描述

Input: root = [3,9,20,null,null,15,7]
Output: [3.00000,14.50000,11.00000]
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].

Example 2:

在这里插入图片描述

Input: root = [3,9,20,15,7]
Output: [3.00000,14.50000,11.00000]

Constraints:

The number of nodes in the tree is in the range [1, 10^4].
-2^31 <= Node.val <= 2^31 - 1

.

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<double> averageOfLevels(TreeNode* root) {
        vector<double> res;
        if(root == NULL)
            return res;
        int next_level = 0, cur_level = 1;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty())
        {
            double sum = 0.0;
            for(int i = 0; i<cur_level; i++)
            {
                TreeNode* cur = q.front();
                q.pop();
                sum += double(cur->val);
                if(cur->left != NULL)
                {
                    q.push(cur->left);
                    next_level++;
                }
                if(cur->right != NULL)
                {
                    q.push(cur->right);
                    next_level++;
                }
            }
            res.push_back(sum/cur_level);
            cur_level = next_level;
            next_level = 0;
        }
        return res;
    }
};