Write an algorithm that takes a tree data structure and writes out all the elements in a breadth-first traversal order.