How to reverse a queue?

[fuzzyDog]

How can I write a reverse function using enqueue and dequeue?

template <class T>
void Dynque<T>::enqueue(T num)
{
	QueueNode *newNode;

	newNode = new QueueNode;
	newNode->value = num;
	newNode->next = NULL;
	if (isEmpty())
		front = rear = newNode;
	else
	{
		rear->next = newNode;
		rear = newNode;
	}
	numItems++;
}

template <class T>
void Dynque<T>::dequeue(T &num)
{
	QueueNode *temp;

	if (isEmpty())
		cout << "The queue is empty.\n";
	else
	{
		num = front->value;
		temp = front->next;
		delete front;
		front = temp;
		numItems--;
	}
}

Thanks in advance.

[MiiNiPaa]

template <typename T>
void reverse(Dynque<T> queue)
{
    std::stack<T> temp_storage;
    while (not queue.isEmpty()) {
        T val;
        queue.dequeue(val);
        temp_storage.push(val);
    }
    while (not temp_storage.empty()) {
        queue.enqueue(temp_storage.top());
        temp_storage.pop();
    }
}