题目:给定一个非空二叉树, 返回一个由每层节点平均值组成的数组。
/**
* 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> ans;
vector<TreeNode *>cur;
if (root) {
cur.push_back(root);
}
vector<TreeNode *>nextLevel;
while (!cur.empty()) {
nextLevel.clear();
double sum = 0.0;
for (auto c : cur) {
sum += c->val;
if (c->left) {
nextLevel.push_back(c->left);
}
if (c->right) {
nextLevel.push_back(c->right);
}
}
ans.push_back(sum/cur.size());
cur.swap(nextLevel);
}
return ans;
}
};