Breadth first search

Steps:

  1. Add root to queue
  2. If left child not null, add it to queue
  3. If right child not null, add it to queue
  4. Repeat 2 & 3 until the queue is empty