给定一个非空二叉树, 返回一个由每层节点平均值组成的数组.
简单题 层次遍历
vector<double> averageOfLevels(TreeNode* root)
{
vector<double>res;
if (root == NULL)
return res;
else
{
queue<TreeNode *>temp;
temp.push(root);
while (temp.empty())
{
int s = temp.size();
double count = 0;
for (int i = 0; i < s; i++)
{
TreeNode* p = temp.front();
count += p->val;
if (p->left)
temp.push(p->left);
if (p->right)
temp.push(p->right);
temp.pop();
}
res.push_back(count*1.0 / s);
}
return res;
}
}