class Solution {
public:
vector<double> averageOfLevels(TreeNode* root) {
queue<TreeNode *>que;
if(root!=NULL)que.push(root);
vector<double>result;
while(!que.empty()){
int size=que.size();
vector<int>vec;
double sum=0.0;
for(int i=0;i<size;i++){
TreeNode *node=que.front();
que.pop();
sum+=node->val;
if(node->left)que.push(node->left);
if(node->right)que.push(node->right);
}
sum=sum/size;
result.push_back(sum);
}
return result;
}
};
轻松题 一次过