LeetCode 637. Average of Levels in Binary Tree

Given the root of a binary tree, return the average value of the nodes on each level in the form of an array. Answers within 10-5 of the actual answer will be accepted.

Example 1:

Input: root = [3,9,20,null,null,15,7]
Output: [3.00000,14.50000,11.00000]
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].

Example 2:

Input: root = [3,9,20,15,7]
Output: [3.00000,14.50000,11.00000]

Constraints:

• The number of nodes in the tree is in the range [1, 104].
• -231 <= Node.val <= 231 - 1

---

就，求每层的平均值，太直观的level order traversal了，闭着眼睛就写出来了。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Double> averageOfLevels(TreeNode root) {
        List<Double> result = new ArrayList<>();
        Queue<TreeNode> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            double sum = 0;
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.remove();
                sum += node.val;
                if (node.left != null) {
                    queue.add(node.left);
                }
                if (node.right != null) {
                    queue.add(node.right);
                }
            }
            result.add(1.0 * sum / size);
        }
        return result;
    }
}

---

然后看了答案发现还可以递归做，就学习了一下递归的思路。递归其实不是leve order traversal，只是在DFS的时候记录每一层的sum和count，最后在主函数里递归完以后求均值。于是递归函数就需要把当前的层数、sum和count的list，和必不可少的root传进去。当root为null时就return，否则需要把当前这个节点更新到对应层数的sum和count里。注意这里只能用list size来判断，没有getOrDefault这种操作……真是傻了。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Double> averageOfLevels(TreeNode root) {
        List<Double> sum = new ArrayList<>();
        List<Integer> count = new ArrayList<>();
        average(root, 0, sum, count);

        List<Double> result = new ArrayList<>();
        for (int i = 0; i < sum.size(); i++) {
            result.add(sum.get(i) / count.get(i));
        }
        return result;
    }

    private void average(TreeNode root, int i, List<Double> sum, List<Integer> count) {
        if (root == null) {
            return;
        }
        if (i < sum.size()) {
            sum.set(i, sum.get(i) + root.val);
            count.set(i, count.get(i) + 1);
        } else {
            sum.add(1.0 * root.val);
            count.add(1);
        }
        average(root.left, i + 1, sum, count);
        average(root.right, i + 1, sum, count);
    }
}