Stack to queue

This is a very interesting problem. Here is what you do.

Take two stacks, call one stack the loading stack and the other unloading.

To enqueue:

1. Push the given thing on the loading stack.

To dequeue:

1. First, check the unloading queue. If it's not empty, immediately pop from there. Otherwise, go to step 2.
2. Pop the items in the loading stack and push them onto the unloading stack one-by-one. Repeat until the loading stack is empty.
3. Pop the item at the top of the unloading stack and output.

When we have a new element we push it into an empty stack then we pop all the elements from the used stack into the stack where we pushed the last element.

Well, we can't really fully implement a queue since the time complexity of enqueuing or dequeuing will not be able to match that of a normal queue.

The first stack can be named temporary stack and the second queue stack. The queue stack will be the queue in stack form. The temporary stack will help in enqueuing.

My idea:

To enqueue:

Push all current elements in the queue stack into the temporary stack. Now push the element into the queue stack, then push all elements from the temporary stack back into the queue stack.

To dequeue:

Just pop the top element of the queue stack.