LeetCode每日一题 637. Average of Levels in Binary Tree

637. Average of Levels in Binary Tree

Tag Tree

Difficulty Easy

Link https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/

思路1 DFS

使用深度优先遍历需要维护两个数组，分别是sums用于记录每一层的元素之和，counts用于记录每一层的元素数量。

/**
 * 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<>();
        List<Double> sums = new ArrayList<>();
        List<Integer> counts = new ArrayList<>();
        
        dfs(root, 0, sums, counts);
        for (int i = 0; i < sums.size(); i++) {
            res.add(sums.get(i) / counts.get(i));
        }
        
        return res;
        
    }
    
    public void dfs(TreeNode root, int level, List<Double> sums, List<Integer> counts) {
        // 基准条件，当遍历到null时退出
        if (root == null) {
            return;
        }
        
        // 如果层数比
        if (level < sums.size()) {
            sums.set(level, sums.get(level) + root.val);
            counts.set(level, counts.get(level) + 1);
        }
        else {
            sums.add(root.val * 1.0);
            counts.add(1);
        }
        
        dfs(root.left, level + 1, sums, counts);
        dfs(root.right, level + 1, sums, counts);
    }
}

思路2：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.offer(root);
        
        while (!queue.isEmpty()) {
            double sum = 0;
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                sum += node.val;
                TreeNode left = node.left, right = node.right;
                if (left != null) {
                    queue.offer(left);
                }
                if (right != null) {
                    queue.offer(right);
                }
            }
            res.add(sum / size);
        }
        return res;
    }
}