Data-Structures/array_stack.cpp at master · Vishruth-S/Data-Structures · 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
#include <iostream>
using namespace std;

int a[200];
int top=-1;

void push();
void pop();
void display();

int main()
{
	int ch;
	do{
		cout<<"\nSELECT Option\n";
		cout<<"\n1.Push";
		cout<<"\n2.Pop";
		cout<<"\n3.Display";
		cout<<"\n4.Exit\n\n";
		cin>>ch;
		switch(ch)
		{
			case 1:push();
				   break;
			case 2:pop();
				   break;
			case 3:display();
				   break;
		}
	}while(ch<4);
	return 0;
}

void push()
{
	int max=200;
	if(top==max-1)
		cout<<"\nOVERFLOW";
	else{
		top++;
		cout<<"\nENTER ELEMENT\n";
		cin>>a[top];
	}
}

void pop()
{
	int max=200;
	if(top==-1)
		cout<<"\nUNDERFLOW";
	else
	{
		cout<<"\nDELETED  "<<a[top];
		top--;
	}
}

void display()
{
	if(top==-1)
		cout<<"\nUNDERFLOW";
	else{
		for(int i=0;i<=top;i++)
			cout<<a[i]<<"  ";
	}
}