637. 二叉树的层平均值
题目描述
解题思路
二叉树的层次遍历
代码实现
"""
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def averageOfLevels(self, root: TreeNode) -> List[float]:
stack = [root]
res = []
while stack:
size = len(stack)
_sum = 0
for _ in range(size):
node = stack.pop(0)
_sum += node.val
if node.left:
stack.append(node.left)
if node.right:
stack.append(node.right)
res.append(_sum / size)
return res
参考文献
1、官方题解