Answer
Devising an algorithm for listing the vertices of an ordered
rooted tree in level order.
Work Step by Step
procedure level (T: ordered rooted tree with root r)
queue := sequence consisting of just the root r
while queue contains at least one term
v := first vertex in queue
list v
remove v from queue and put children of v on to the end of queue
