Given the root node root of a binary tree, return an array where the element at index $i$ is the maximum value among all nodes on level $i$ of the tree, with the root considered level $0$. If the tree is empty, return an empty array.

Constraints:

• The number of nodes in the tree is in the range $[0, 10^4]$.

• $-2^{31} \leq$ Node.val $\leq 2^{31} - 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.