-
Notifications
You must be signed in to change notification settings - Fork 0
/
my_stack.h
76 lines (56 loc) · 1.09 KB
/
my_stack.h
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
#include <iostream>
#include <conio.h>
using namespace std;
struct bucket
{
int data;
bucket* link;
};
struct bucket* top;
void push(int data)
{
struct bucket* temp;
temp = new bucket();
if (!temp) {
cout << "\nHeap Overflow";
exit(1);
}
temp->data = data;
temp->link = top;
top = temp;
}
int isEmpty()
{
return top == NULL;
}
int peek()
{
if (!isEmpty())
return top->data;
else
exit(1);
}
void bpop()
{
struct bucket* temp;
if (top == NULL) {
cout << "\nStack Underflow" << endl;
exit(1);
}
else {
temp = top;
top = top->link;
temp->link = NULL;
// release memory of top node
free(temp);
}
cout<<"Your Trolli No is :"<<top->data<<endl;
cout<<" ___"<<endl;
cout<<" / |"<<endl;
cout<<" ______________/ --"<<endl;
cout<<" |___/___/___/_| "<<endl;
cout<<" |__/___/___/__| "<<endl;
cout<<" |_/___/___/___| "<<endl;
cout<<" _______/ "<<endl;
cout<<" O O "<<endl;
}