-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstack with LinkedList,Template&OOP.cpp
119 lines (110 loc) · 2.15 KB
/
stack with LinkedList,Template&OOP.cpp
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
#include <iostream>
#include <string>
using namespace std;
class EmptyStackException
{
public:
EmptyStackException()
{
cout << "Stack is empty!" << endl;
}
};
template <class T>
class Node
{
public:
T data;
Node<T> *next;
Node(T data)
{
this->data = data;
this->next = NULL;
}
};
template <class T>
class Stack
{
public:
Node<T> *head;
Stack()
{
this->head = NULL;
}
~Stack()
{
Node<T> *temp = this->head;
while(temp != NULL)
{
Node<T> *next = temp->next;
delete temp;
temp = next;
}
}
void push(T data)
{
Node<T> *newNode = new Node<T>(data);
if(this->head==NULL) this->head = newNode;
else {
newNode->next = this->head;
this->head = newNode;
}
}
void pop()
{
if(this->head==NULL) cout << "Stack is empty!" << endl;
else {
Node<T> *tmp = this->head;
this->head = this->head->next;
delete tmp;
}
}
bool isEmpty()
{
return this->head==NULL;
}
T top()
{
if(this->isEmpty()) throw EmptyStackException();
else return this->head->data;
}
void print()
{
if(this->head==NULL) cout << "Stack is empty!" << endl;
else {
Node<T> *tmp;
tmp = this->head;
while (tmp!=NULL)
{
cout << tmp->data << " ";
tmp = tmp->next;
}
cout << endl;
}
}
};
int main()
{
// Stack<int> st;
// st.push(5);
// st.push(4);
// st.push(3);
// st.push(2);
// st.push(1);
// st.print();
// st.pop();
// st.pop();
// st.pop();
// st.print();
// st.~Stack();
// Stack<string> st;
// st.push("Three");
// st.push("Two");
// st.push("One");
// st.print();
Stack<char> st;
st.push('C');
st.push('B');
st.push('A');
st.print();
return 0;
}