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