nodes= [xfornodeinnodesforxin(node.left, node.right)ifx]returnans 解法2: DFS #Definition for a binary tree node.#class TreeNode(object):#def __init__(self, x):#self.val = x#self.left = None#self.right = NoneclassSolution(object):defaverageOfLevels(self, root):""":type root: T...
1#Definition for a binary tree node.2#class TreeNode(object):3#def __init__(self, x):4#self.val = x5#self.left = None6#self.right = None78classSolution(object):9defaverageOfLevels(self, root):10"""11:type root: TreeNode12:rtype: List[float]13"""14levels = [[root]]#将要...
* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ classSolution{ public: longlonga[100000]; intb[100000]; voidf(TreeNode*root,intd) { if(root!=NULL...
Note: The range of node's value is in the range of 32-bit signed integer. 2.解决思路和代码 循环每层的节点,保存到二维数组,二维数组的一个值保存这一层节点的值之和,另外一个值保存这一层的节点个数。 class Solution: def averageOfLevels(self, root): info = [] self.dfs(info, root, 0...
The range of node's value is in the range of 32-bit signed integer. 思路: 本题具体思路是使用二叉树的层次遍历法,具体可以参考以前写的一篇博客:107.Binary Tree Level Order Traversal II要注意的是,在求平均值时,求和可能会溢出,所以代码中将数据类型定义为long,详情请查看accumulate的相关用法及注意点 ...
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: tree 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....
Average of Levels in Binary Tree [思路]:获得树每一层的平均值,使用广度优先搜索。那么使用方法: 广度优先 deque
题目: Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. Example 1: Note: 分析: 题目很好理解,就是求二叉树每一层的
637. Average of Levels in Binary Tree 回到顶部 题意 给定非空二叉树,求出每一层数的平均值 回到顶部 思路 利用队列存储每一层的数,存完之后需要取出size,再循环求平均值。这样保证了循环的次数就是每一层的结点数。 回到顶部 代码 /** * Definition for a binary tree node. ...
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 7Output:[3, 14.5, 11]Explanation: Note: The range of node’s value is in the range of 32-bit signed integer. ...