Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level).
Solution
Step 1: Using a Queue visit node and Enqueue nodes (discovered nodes)
Step 2: Dequeue root and visit children
