给定一个非空二叉树, 返回一个由每层节点平均值组成的数组.
示例 1:
输入:
3
/ \
9 20
/ \
15 7
输出: [3, 14.5, 11]
解释:
第0层的平均值是 3, 第1层是 14.5, 第2层是 11. 因此返回 [3, 14.5, 11].
注意:
节点值的范围在32位有符号整数范围内。
C++
/**
* 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:
void func(TreeNode* root,vector<pair<int,long long>>& tmp,int n)
{
if(NULL==root)
{
return;
}
else
{
if(n==tmp.size())
{
tmp.resize(n+1);
}
tmp[n].first++;
tmp[n].second+=root->val;
func(root->left,tmp,n+1);
func(root->right,tmp,n+1);
}
}
vector<double> averageOfLevels(TreeNode* root)
{
vector<double> res;
vector<pair<int,long long>> tmp;
func(root, tmp, 0);
for(int i=0;i<tmp.size();i++)
{
res.push_back((double(tmp[i].second))/tmp[i].first);
}
return res;
}
};
python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def func(self, root, tmp, n):
if None==root:
return tmp
else:
if n==len(tmp):
tmp.append([0,0])
tmp[n][0]+=1
tmp[n][1]+=root.val
tmp=self.func(root.left,tmp,n+1)
tmp=self.func(root.right,tmp,n+1)
return tmp
def averageOfLevels(self, root):
"""
:type root: TreeNode
:rtype: List[float]
"""
res=[]
tmp=[]
tmp=self.func(root,tmp,0)
for i in range(len(tmp)):
res.append(tmp[i][1]/tmp[i][0])
return res