637. Average of Levels in Binary Tree

發表於 | 分類於

problem

solution

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