Binary Tree Level Order Traversal

Return the node values of a binary tree level by level from left to right.

Each inner array should contain all values from one depth of the tree, starting at the root level.

Examples
Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]
Hints
Related Problems

Binary Tree Level Order Traversal

Return the node values of a binary tree level by level from left to right.