LeetCode_Archiver/LeetCode/cpp/637.cpp at master · chr1sc2y/LeetCode_Archiver · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
    vector<double> averageOfLevels(TreeNode *root) {
        vector<double> average;
        if (!root)
            return average;
        queue<TreeNode *> que;
        que.push(root);
        while (!que.empty()) {
            int len = que.size();
            double ave = 0.0;
            for (int i = 0; i < len; ++i) {
                TreeNode *temp = que.front();
                ave += temp->val;
                que.pop();
                if (temp->left) que.push(temp->left);
                if (temp->right) que.push(temp->right);
            }
            average.push_back(ave / len);
        }
        return average;
    }
};