Queue and Stacks help

closed account (GybDjE8b)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
  #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();
}
}
closed account (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.
Topic archived. No new replies allowed.