637.二叉树的层平均值
题目描述
https://leetcode-cn.com/problems/average-of-levels-in-binary-tree
给定一个非空二叉树, 返回一个由每层节点平均值组成的数组.
示例 1:
输入:
输出: [3, 14.5, 11]
解释:
第0层的平均值是 3, 第1层是 14.5, 第2层是 11. 因此返回 [3, 14.5, 11].
解题思路
BFS广度优先搜索,首先将第一层的root结点放入队列queue,边出队列边算这层结点的平均值并将下一层的结点加入到队列queue,最后将该层平均值加入列表res
java代码
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public List<Double> averageOfLevels(TreeNode root) {
List<Double> res = new ArrayList<>();
if(root == null) return res;
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
int cnt = queue.size();
double sum = 0;
for(int i = 0; i < cnt; i++){
TreeNode node = queue.poll();
sum += node.val;
if(node.left != null) queue.add(node.left);
if(node.right != null) queue.add(node.right);
}
res.add(sum / cnt);
}
return res;
}
}
python代码
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
from collections import deque
class Solution:
def averageOfLevels(self, root: TreeNode) -> List[float]:
res = []
if not root:
return res
queue = deque()
queue.append(root)
while queue:
cnt = len(queue)
sum = 0
for i in range(cnt):
node = queue.popleft()
sum += node.val
if node.left != None:
queue.append(node.left)
if node.right:
queue.append(node.right)
res.append(sum * 1.0 / cnt)
return res