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:

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

思路：广度优先遍历

注意：由于是double，所以设置sum和cnt格式为double，加入为int，会舍弃小数部分

代码1（better）：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<double> averageOfLevels(TreeNode* root) {
        vector<double> res;
        queue<TreeNode*> q;
        q.push(root);
        while(!q.empty()) {
            long temp=0;
            int s=q.size();
            for(int i=0;i<s;i++) {
                TreeNode* t=q.front();
                q.pop();
                if(t->left) q.push(t->left);
                if(t->right) q.push(t->right);
                temp+=t->val;
            }
            res.push_back((double)temp/s);
        }
        return res;
    }
};

代码2：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<double> averageOfLevels(TreeNode* root) {
        vector<double> res;
        double sum=0.0,cnt=0.0;
        queue<TreeNode*> sp,spson;
        sp.push(root);
        while(!sp.empty()){
            TreeNode* temp;
            temp=sp.front();
            sp.pop();
            sum += temp->val;
            cnt += 1;
            if(temp->left!=NULL){spson.push(temp->left);}
            if(temp->right!=NULL){spson.push(temp->right);}
            if(sp.empty()){
                res.push_back(sum/(cnt));
                sum=0;
                cnt=0;
                sp=spson;
                spson=queue<TreeNode*>();
            }
        }
        return res;
    }
};