-
Notifications
You must be signed in to change notification settings - Fork 0
/
LIFO.cpp
89 lines (70 loc) · 1.27 KB
/
LIFO.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
#include <iostream>
using namespace std;
template <class H> class Node{
private:
H key;
Node<H> *next;
public:
Node(H k, Node<H> *n=0) : key(k), next(n) {}
void setKey(H k){
key=k;
}
void setNext(Node<H> *n){
next=n;
}
H getKey() const{
return key;
}
Node<H>* getNext() const{
return next;
}
};
template <class H> class Stack{
private:
Node<H> *pointer;
public:
Stack(){
pointer=0;
}
~Stack(){
Node<H>* aux=pointer;
while(pointer){
aux=pointer;
pointer=pointer->getNext();
delete aux;
}
}
Stack<H>* push(H x){
pointer=new Node<H>(x, pointer);
return this;
}
Stack<H>* pop(){
if(!pointer){
cout<<"Stack is Empty"<<endl;
return this;
}
Node<H>* aux=pointer;
pointer=pointer->getNext();
delete aux;
return this;
}
void print(){
Node<H>* aux=pointer;
while(aux){
cout<<aux->getKey()<<" ";
aux=aux->getNext();
}
cout<<endl;
}
void clear(){
pointer=0;
}
};
int main(){
Stack<int>* s=new Stack<int>();
s->push(8)->push(10)->push(3)->push(5)->push(4)->print();
s->pop()->pop()->pop()->pop()->pop()->push(47)->print();
s->clear();
s->print();
delete s;
}