Leetcode:637. 二叉树的层平均值 - 力扣(LeetCode) (leetcode-cn.com)
时间复杂度:O(n)
空间复杂度:O(n)
层序遍历
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution(object):
def averageOfLevels(self, root):
"""
:type root: TreeNode
:rtype: List[float]
"""
queue,visited=[],[]
if root:
queue.append(root)
while queue:
tmp=[]
sum_,num_=0.0,0.0
while queue:
node=queue.pop(0)
sum_+=node.val
num_+=1
if node.left:
tmp.append(node.left)
if node.right:
tmp.append(node.right)
visited.append(sum_/num_)
queue=tmp
return visited