DSA-Codes/ADT-Stack.cpp at main · Cyber-Programmer/DSA-Codes · 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

#include <iostream>
#include <conio.h>
using namespace std;

struct Stack
{
	int top;
	int size;
	int* ptr;
};
void createStack(struct Stack* stc)
{
	cout<<"Enter the size of Stack you want to create: ";
	cin>>stc->size;
	stc->ptr=new int[stc->size];
	stc->top = -1;
	cout<<"Stack created. \n";
}
bool isEmpty(struct Stack* stc){
	if(stc->top == -1)
	{
		return true;
	}
	else
	{
		return false;
	}


}
bool isFull(struct Stack* stc){
	if(stc->top == stc->size-1)
	{
		return true;
	}
	else
	{
		return false;
	}
}
void display(struct Stack* stc)
{
	if(isEmpty(stc))
	{
		cout<<"Stack is empty. Nothing to show. \n";
	}
	else{
		for(int i =0;i<=stc->top;i++)
		{
			cout<<stc->ptr[i]<<" ";
		}
		cout<<endl;
	}

}
void insertion(struct Stack* stc)
{
	if(isFull(stc))
	{
		cout<<"Stack is full. \n";
	}
	else{
		stc->top = stc->top+1;
		cout<<"Enter Value to be inserted: ";
		cin>>stc->ptr[stc->top];
		display(stc);
	}
}
int deletion(struct Stack* stc)
{
	if(isEmpty(stc))
	{
		cout<<"Stack is empty. \n";
	}
	else{
		int temp = stc->ptr[stc->top];
		stc->top = stc->top-1;
		return temp;
	}
}
void peek(struct Stack* stc)
{
	if(isEmpty(stc))
	{
		cout<<"Stack is empty. \n";
	}
	else{
		int value;
		cout<<"Enter the value you want to peek: ";
		cin>>value;
			for(int i =0;i<=stc->top;i++)
		{
			if(stc->ptr[stc->top] == value)
			{
				cout<<value<<" found at index "<<i<<endl;
				break;
			}
		}
	}
}

int main()
{
	int opt;
	struct Stack stk;
	createStack(&stk);
	while(true)
	{
		cout<<"Choose What You Want To Do: \n 1)Push \n 2)Pop \n 3)Display Stack \n 4)Is Full \n 5)Is empty \n 6)Peek \n 7)Quit \n Choose: ";
		cin>>opt;

		if (opt == 1)
		{
			insertion(&stk);
		}
		else if(opt == 2)
		{
			int value = deletion(&stk);
			cout<<value<<endl;
		}
		else if(opt == 3)
		{
			display(&stk);
		}
		else if(opt == 4)
		{
			if(isFull(&stk))
			{
				cout<<"Stack is full.";
			}
			else{
				cout<<"You have "<<stk.size-stk.top-1<<" spaces available for insertion. \n";
			}
		}
		else if(opt == 5)
		{
			if(isEmpty(&stk))
			{
				cout<<"Stack is empty.";
			}
			else{
				cout<<"You have occupied "<<stk.top+1<<" spaces for insertion. \n";
			}
		}
		else if(opt == 6)
		{
			peek(&stk);
		}
		else if(opt == 7)
		{
			break;
		}

	}


	return 0;

}