stack-linked/linkedStackType.h at main · Danhh-zk/stack-linked · GitHub

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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
#pragma once
#include <iostream>
#include "linkedStackType.h"

using namespace std;

template <class Type>

struct nodeType
{
	Type info;

nodeType<Type>* link;

};

template<class Type>
class linkedStackType

{

private:

	nodeType<Type>* stackTop;

public:

	linkedStackType();

	void initializeStack();
	bool isEmptyStack();

	bool isFullStack();

	void push(const Type& newItem);

	void pop(Type& poppedElement);

	void destroyStack();

	~linkedStackType();

	const linkedStackType<Type>& operator= (const linkedStackType<Type>&);

	linkedStackType(const linkedStackType<Type>& otherStack);

};

template<class Type>

linkedStackType<Type>::linkedStackType()

{
	stackTop = NULL;
}


template<class Type>

void linkedStackType<Type> ::destroyStack()
{
nodeType<Type> *temp;

while (stackTop != NULL)

{
	temp = stackTop;

	stackTop = stackTop->link;

	delete temp;

}

}

template<class Type>
void linkedStackType<Type>::initializeStack()
{
destroyStack();

}

template<class Type>
bool linkedStackType<Type>::isEmptyStack()

{
	return(stackTop== NULL);
}

template<class Type>

bool linkedStackType<Type>::isFullStack()

{
	return 0;
}

template<class Type>

void linkedStackType<Type>::push(const Type& newElement)

{

	nodeType<Type>* newNode;

	newNode = new nodeType<Type>;

	newNode->info = newElement;

	newNode->link = stackTop;

	stackTop = newNode;
}
	template<class Type>

	void linkedStackType<Type>::pop(Type & poppedElement)
	{
		nodeType<Type>* temp;

	poppedElement= stackTop->info;

	temp = stackTop;

	stackTop= stackTop->link;

	delete temp;

}

template<class Type>

linkedStackType<Type>::linkedStackType(const linkedStackType<Type>& otherStack)
{
nodeType<Type>* newNode, *current, * last;

if (otherStack.stackTop == NULL)

stackTop = NULL;

else

{

	current =otherStack.stackTop;

	stackTop = new nodeType<Type>;

	stackTop->info = current->info;

	stackTop->link = NULL;

	last =stackTop;

	current = current->link;

	while (current != NULL)

	{

		newNode =new nodeType<Type>;

		newNode->info = current->info;

		newNode->link = NULL;
		last->link =newNode;

		last = newNode;

		current =current->link;

	}

}

}

template<class Type>

linkedStackType<Type>::~linkedStackType()

{

	nodeType<Type>* temp;

	while (stackTop != NULL)

	{


		temp = stackTop;

		stackTop = stackTop->link;
			delete temp;

	}

}

template<class Type>

const linkedStackType<Type>& linkedStackType<Type>::operator= (const linkedStackType<Type>& otherStack)
{
	nodeType<Type>* newNode, * current, * last;

	if (this != &otherStack)

	{

		if (stackTop != NULL)
			destroyStack();

		if (otherStack.stackTop == NULL)

			stackTop = NULL;

		else

		{

			current = otherStack.stackTop;

			stackTop = new nodeType<Type>;
			stackTop->info = current->info;
			last = stackTop;
			current = current->link;

			stackTop->link = NULL;

			while (current != NULL)

			{
				newNode = new nodeType<Type>;

				newNode->link = NULL;

				newNode->info = current->info;
				last->link = newNode;
				last = newNode;

				current = current->link;

			}

		}

	}

	return *this;
}