1. Enqueue all the tree's nodes (from left to right) at a level in the queue.
2. Dequeue the first node of the queue: curr, read its data and add it into the ArrayList <Integer> .
3. Enqueue both the child nodes of curr.
Repeat step 1 to 3 until the queue is empty.