这道题目要求找到二叉树中子节点平均值最大的子树的平均值。问题可以通过递归解决，每次返回子树的总和与节点数量，以计算平均值。全局变量用于保存最大平均值。代码实现中要注意使用double类型处理平均值，并进行时间复杂度为O(n)的优化。在线评测显示，该解决方案在运行时间和内存使用上都表现出色。
题目：
Given the root of a binary tree, find the maximum average value of any subtree of that tree.
(A subtree of a tree is any node of that tree plus all its descendants. The average value of a tree is the sum of its values, divided by the number of nodes.)
Example 1:
Input: [5,6,1]
Output: 6.00000
Explanation:
For the node with value = 5 we have an average of (5 + 6 + 1) / 3 = 4.
For the node with value = 6 we have an average of 6 / 1 = 6.
For the node with value = 1 we have an average of 1 / 1 = 1.
So the answer is 6 which is the maximum.
Note:
- The number of nodes in the tree is between
1and5000. - Each node will have a value be
最低0.47元/天 解锁文章
1656
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
