LeetCode637.二叉树的层平均值

```cpp
/**
 * 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) 
    {
        deque<TreeNode*> queue;
        vector<double> res;
        if (root == NULL) return res;
        queue.push_back(root);

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