-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathStack.cpp
135 lines (98 loc) · 1.99 KB
/
Stack.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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <iostream>
using namespace std;
//Node
template<class T>
struct Node{
T v;
Node *next;
Node(T V,Node *nextNode){
v=V;
next=nextNode;
}
};
//List
template <class T>
struct Stack{
Node<T> *top;
Stack():top(nullptr){};
~Stack(){
while(!IsEmpty()){
pop();
}
}
bool IsEmpty();
void push(T x);
void pop();
void Print();
};
// Is Empty
template <class T>
bool Stack<T>::IsEmpty(){
if(!top){
return true;
}
else{
return false;
}
}
// Push
template <class T>
void Stack<T>::push(T x){
top = new Node<T>(x,top);
}
// Pop
template <class T>
void Stack<T>::pop(){
T value=0;
Node<T>*tmp;
if(!IsEmpty()){
value= top->v;
tmp=top;
top=top->next;
delete tmp;// Delete
}
else{
cout<< "The Stack is Empty"<<endl;
}
}
// Print
template <class T>
void Stack<T>::Print(){
for(Node<T>* i=top; i ; i=i->next){
cout<<i->v<<"->";
}
cout<<"NULL";
cout<<endl;
}
int main (){
Stack<int> l;
cout<< "------ STACK -------"<<endl;
cout << " 1 = Push" << endl;
cout << " 2 = Pop" << endl;
cout << " 3 = Imprimir" << endl;
cout << " 4 = Terminar" << endl;;
bool code=true;
char tecla;
while(code){
cout << "- Chose an a option: ";
cin >> tecla;
switch(tecla){
case '1':
int numero;
cout << "Number to make Push: ";
cin>>numero;
l.push(numero);
break;
case '2':
l.pop();
break;
case '3':
l.Print();
break;
case '4':
l.~Stack();
code=false;
break;
}
}
}