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:

1. The range of node's value is in the range of 32-bit signed integer.

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */

/*可以使用BFS和DFS方法（广度优先搜索和深度优先搜索），这里使用的是BFS*/

class Solution 
{
public:
    vector<double> averageOfLevels(TreeNode* root) 
    {
        vector<double> v;
        queue<TreeNode*> q;
        q.push(root);
        
        while(!q.empty())
        {
            double temp=0;
            int q_size=q.size();
            for(int i=0;i<q_size;i++)
            {
                TreeNode* t=q.front();
                q.pop();
                if(t->left) q.push(t->left);
                if(t->right) q.push(t->right);
                temp+=t->val;
            }
            v.push_back(temp/q_size);
        }
        return v;
    }

};