Level average Given the root of a binary tree, write a function to return a list of averages of nodes at each level from top to bottom. Example 1 > - **Input:** root = [1, 2, 3, 4, null, null, 7] > - **Output:** [1, 3, 6] > - **Explanation:** The average (rounded off to the nearest integer) of the first, second, and third levels is 1, 3, and 6, respectively. Example 2 > - **Input:** root = [1, 8, 4, null, null, 2, 7] > - **Output:** [1, 6, 5] > - **Explanation:** The average (rounded off to the nearest integer) of the first, second, and third levels is 1, 6, and 5, respectively.

Optimal Solution: Time Complexity O(N), Space Complexity O(1). Codeintuition provides an interactive coding environment for this problem.

Level average | Binary Tree

Hide Index

Binary Tree

0% completed

Liking the course? Check our discounted plans to continue learning.