感觉BFS还是舒服啊
class Solution(object):
def averageOfLevels(self, root):
"""
:type root: TreeNode
:rtype: List[float]
"""
self.ans=[]
self.list=[]
self.list.append(root)
while self.list:
sum=0.0
l=len(self.list)
for _ in range(l):
curr=self.list.pop(0)
if curr.left:
self.list.append(curr.left)
if curr.right:
self.list.append(curr.right)
sum+=curr.val
self.ans.append(sum/l)
return self.ans