主页有其他数据结构内容(持续更新中)
难度:Easy
代码:
/**
* 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) {
vector<double> ans;
queue<TreeNode*> myQueue;
myQueue.push(root);
while(!myQueue.empty()) {
double sum = 0;
int num = myQueue.size();
for (int i = 0; i < num; i++) {
TreeNode* temp = myQueue.front();
if (temp != nullptr) {
sum += temp->val;
}
if(temp->left != nullptr) {
myQueue.push(temp->left);
}
if(temp->right != nullptr) {
myQueue.push(temp->right);
}
myQueue.pop();
}
ans.emplace_back(sum / num);
}
return ans;
}
};