<leetcode>637. Average of Levels in Binary Tree

最新推荐文章于 2022-09-15 21:16:55 发布

link_98

最新推荐文章于 2022-09-15 21:16:55 发布

阅读量259

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode LeetCode题解文章标签： java leetcode 题解

本文链接：https://blog.youkuaiyun.com/qq_32832023/article/details/78322450

LeetCode题解同时被 2 个专栏收录

60 篇文章

订阅专栏

LeetCode

59 篇文章

订阅专栏

本文介绍了一种算法，用于计算二叉树各层级节点值的平均数。通过广度优先搜索（BFS），该算法有效地实现了对二叉树每个层级的遍历，并计算出了各层级节点值的平均数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

637. Average of Levels in Binary Tree

Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.

Example 1:

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].

Note:

The range of node's value is in the range of 32-bit signed integer.

题目大意：就是二叉树的同层级的结点的值的和求平均值

方法：一开始一直想着中序，左序，右序遍历，就想着拷贝一个相同的二叉树，想想很麻烦，就觉得应该是方法错误了。看了discuss的提示才想到BFS和DFS，，，看了二叉树都忘了、、这题BFS，存在队列里，就可以了

/**
 * 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 < > ();
        Queue < TreeNode > queue = new LinkedList < > ();
        queue.add(root);
        while (!queue.isEmpty()) {
            long sum = 0, count = 0;
            Queue < TreeNode > temp = new LinkedList < > ();
            while (!queue.isEmpty()) {
                TreeNode n = queue.remove();
                sum += n.val;
                count++;
                if (n.left != null)
                    temp.add(n.left);
                if (n.right != null)
                    temp.add(n.right);
            }
            queue = temp;
            res.add((double)sum/ count);
        }
        return res;
    }
}