题目:
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.
Example:
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. Hence return [3, 14.5, 11].
分析:
题目大意:给定一个非空的二叉树,以数组的形式返回每一层的均值。
思路:广度优先遍历(BFS),已知每一层节点的个数,计算每一层的平均数。
参考代码:
public List<Double> averageOfLevels(TreeNode root) {
List<Double> result = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
if(root==null) return null;
queue.add(root);
while(!queue.isEmpty()) {
int n = queue.size();
double sum = 0;
for(int i=0; i<n; i++) {
TreeNode node = queue.poll();
sum += node.val;
if(node.left!=null) queue.add(node.left);
if(node.right!=null) queue.add(node.right);
}
result.add(sum/n);
}
return result;
}
List<Double> result = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
if(root==null) return null;
queue.add(root);
while(!queue.isEmpty()) {
int n = queue.size();
double sum = 0;
for(int i=0; i<n; i++) {
TreeNode node = queue.poll();
sum += node.val;
if(node.left!=null) queue.add(node.left);
if(node.right!=null) queue.add(node.right);
}
result.add(sum/n);
}
return result;
}