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 = Noneclass
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...
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]]#将要...
LeetCode-Average of Levels in Binary Tree Description: 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: The range of node’s value is in the range of 32-bit sign......
leetcode Add to List 637. Average of Levels in Binary Tree,就是对二叉树每一层求平均值。开始想法用层次遍历,然而又不知道该点是在哪一层。所以要求没一点的深度,而通过先序遍历递归求没一点的深度的过程中。好像并不需要再去层次遍历,结果就已经很明显了。要注意l
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def averageOfLevels(self, root): """…
Average of Levels in Binary Tree [思路]:获得树每一层的平均值,使用广度优先搜索。那么使用方法: 广度优先 deque
637. Average of Levels in Binary Tree 回到顶部 题意 给定非空二叉树,求出每一层数的平均值 回到顶部 思路 利用队列存储每一层的数,存完之后需要取出size,再循环求平均值。这样保证了循环的次数就是每一层的结点数。 回到顶部 代码 /** * Definition for a binary tree node. ...
* 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:vector<double>averageOfLevels(TreeNode* root){if(!root){return{}; ...
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. ...