Binary Tree Level Order Traversal
Prereq: BFS on Tree
Given a binary tree, return its level order traversal.
The input is the root node of the tree.
The output should be a list of lists of integers,
with the ith list containing the values of nodes on level i,
from left to right.
For example:
