637. Average of Levels in Binary Tree

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Example 1:

Input:
    3
   / \
  9  20
    /  \
   15   7
Output: [3, 14.5, 11]
Explanation:
The average value of nodes on level 0 is 3,  on level 1 is 14.5, and on level 2 is 11. Hence return [3, 14.5, 11].

Note:
The range of node’s value is in the range of 32-bit signed integer.

vector<double> averageOfLevels(TreeNode* root) {
    if (root == NULL)return vector<double>{};
    vector<double> res;
    queue<TreeNode*> temp;
    temp.push(root);
    while (!temp.empty()){
        int size = temp.size();
        double sum = 0;
        for (int i = 0; i < size; i++){
            TreeNode *p = temp.front();
            temp.pop();
            sum += p->val;
            if (p->left)temp.push(p->left);
            if (p->right)temp.push(p->right);
        }
        res.push_back(sum / size);
    }
    return res;
}