 For instance, a queue of strings would have type codice_27, the empty queue is codice_28, and to remove the first element from a queue called codice_29 one would write codice_30.One popular algorithm for breadth-first search of trees makes uses of queues.Here we present a version of that algorithm parameterized over an abstract queue structure