5. Use queue to implement level order traversal conversion in C: (15%)

void level_order (tree *root) { //assume root is not null
node *front, *rear;
// visit tree nodes based on level order by using queue
// use queue by front, rear, enqueue(&rear, root), root =dequeue(&front)
// print the values of tree nodes
// describe the ending condition
}