SolvedProblems/AverageofLevelsinBinaryTree.cpp at main · mucahitrtn/SolvedProblems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/**
 * 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> res;

        queue<TreeNode*> q;
        q.push(root);

        while(!q.empty()){

            double sum = 0;int count = 0;
            queue<TreeNode*> temp;
            while(!q.empty()){

                TreeNode *node=q.front();
                q.pop();
                sum+= node->val;
                count++;

                if (node->left != NULL)
                temp.push(node->left);
                if (node->right != NULL)
                temp.push(node->right);
            }
            q=temp;
            res.push_back(sum/count);
        }

        return res;
    }
};