637. Average of Levels in Binary Tree

最新推荐文章于 2022-09-15 21:16:55 发布

wwyyllaa

最新推荐文章于 2022-09-15 21:16:55 发布

阅读量149

点赞数

本文链接：https://blog.csdn.net/u013055770/article/details/78721712

版权

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.

/**
 * 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;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()){
            double sum = 0;
            int size = q.size();
            for(int i=0; i<size;i++){
                TreeNode* handle = q.front();
                q.pop();
                if(handle->left) q.push(handle->left);
                if(handle->right) q.push(handle->right);
                sum += handle->val;
            }
            res.push_back(sum/size);
        }
        return res;
    }
};

典型的BFS问题，注意double类型即可