要求:如题
思路:
/**
* 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<double> v;
q.push(root);
while(!q.empty()){
double sum=0.0;
int qsize=q.size();
for(int i=0;i<qsize;++i){
TreeNode* tmp=q.front();
sum+=tmp->val;
q.pop();
if(tmp->left)q.push(tmp->left);
if(tmp->right)q.push(tmp->right);
}
v.push_back(sum/qsize);
}
return v;
}
};