Traverse the following binary tree in level order.

Drag the keys into the list below in the requested traversal order.

Some additional problems.

void traverse_levelorder(lint t) {
        queue.put(t);
	do {
                t = queue.get();
		if (t != null) {
		        visit(t);
			put(t.getLeft());
			put(t.getRight());
		}
	} while ( !queue.empty() );
}