Average of Levels in Binary Tree
You are given the root of a binary tree. Return the average of the values on each level, top to bottom, as floats. An empty tree gives [].
Trees appear in the tests in level order, with null for a missing child, like [3,9,20,null,null,15,7]. Each node is a TreeNode with .val, .left and .right; the class is already defined for you.
Example 1
root [3,9,20,null,null,15,7]
returns [3.0,14.5,11.0]
Levels [3], [9, 20], [15, 7] have averages 3.0, 14.5, 11.0.
Constraints
0 <= number of nodes <= 100-2^31 <= node.val <= 2^31 - 1
Write it in your browser, against the clock. The model solution, stepped through line by line, comes after.