Queue and Stacks help

[GybDjE8b]

  #include <iostream>

using namespace std;

template <class T>
class node{
	public:
	T data;
	node *next;
};


template <class T>
class queue{

	node<T> *head;
	node<T> *tail;

	public:

	queue()
	{

		head = tail = NULL;
	}

	bool isEmpty(){
		if(head == NULL) return true;
		else             return false;
	}
	void enqueue(T new_data){
		node<T> *temp = new node<T>;
		temp->data = new_data;
		temp->next = NULL;
		if(isEmpty()){
			head = temp;
			tail = temp;
		}
		else{
			tail->next = temp;
			tail = temp;
		}
	}
	node<T>* dequeue(){
		if(isEmpty())
        {
			cout << "The list is already empty" << endl;
			return NULL;
		}

		node<T>* temp;
		if(head == tail){
		    temp=head;
			delete head;
			head = tail = NULL;
            return temp;
		}
		else{
			temp = head;
			head = head->next;
			delete temp;
			return temp;
		}
	}

	void size(){
		node<T> *current = head;
		while(current != NULL){
			cout << current->data << endl;
			current = current->next;
		}
	}


};

template <class T>
class stack{

	node<T> *head;

	public:

	stack() 
	{

		head = NULL;
	}

	bool isEmpty(){
		if(head == NULL) return true;
		else             return false;
	}
	void push(T new_data){
		node<T> *temp = new node<T>;
		temp->data = new_data;
		temp->next = head;
		if(isEmpty()){
			head = temp;
		}
		else{
			temp->next = head;
			head = temp;
		}
	}

	node<T>* pop(){

		if(isEmpty()){
			cout << "The list is already empty" << endl;
			return NULL;
		}

		node<T>* temp;
        temp = head;
		if(head->next == NULL){
			delete head;
			head = NULL;
			return temp;
		}
		else{
			head = head->next;
			delete temp;
			return temp;
		}
	}

	int top(){
	    if(isEmpty())
	    {
	        cout << "The list is already empty" << endl;
	        return NULL;
	    }

	    return head-> data;
	}

	void size(){
		node<T> *current = head;
		while(current != NULL){
			cout << current->data << endl;
			current = current->next;
		}
	}


};


int main(){
queue<float> thelist;
stack<float> stack1;
stack<float> stack2;
char d = 'y';
int b;
while(d != 'q')
	{
    cout << "Input a number" << endl;
    cin >> b;
    thelist.enqueue(b);
    cout << "Enter y to continue or q to quit" << endl;
	cin >> d;
	}
  thelist.size();
  while(!thelist.isEmpty())
{
    node<float>* temp;
    temp = thelist.dequeue();
    stack1.push(temp->data);
}
while(!stack1.isEmpty())
{
    node<float>* temp;
    temp = stack1.pop();
    stack2.push(temp->data);
}
while(!stack2.isEmpty()){
    node<float>* temp;
    temp = stack2.pop();
    thelist.enqueue(temp->data);
}
	thelist.size();
}
}

[GybDjE8b]

in line 156 i need help since it keep giving me a repeat of enter y to continue
my assignment to Start with a queue and an empty stack. Reverse the order of the queue using the stack.