102. Binary Tree Level Order Traversal

Write a function solve that returns the level order traversal of a binary tree.

Example:
Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Run this challenge interactively in Python or JavaScript when the app loads.