請問資料結構stack/queue的問題QQ

Assuming the following queue methods (functions) exist:
1. void enqueue( queue Q, data D)
This will put data D into queue Q.
2. data dequeue(queue Q)
This will return the first data from the queue Q and remove it from the queue.
3. bool is_empty(queue Q)
This will test if the queue Q is empty or not. If empty, true will be returned. If not, false will be returned.

The following is the pseudo code:

while is_empty(Q2) {
add_to_queue( Q1, dequeue(Q2));
} /* done */

2009-03-31 22:25:04 補充：
The code should be
while not is_empty(Q2)

水~我看發問者也許不知道在說什