Competitive-Programming/sq3.cpp at master · Sartech-B/Competitive-Programming · 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
/* Stack */
#include <bits/stdc++.h>

#define MAX 100001

using namespace std;

int a[MAX], head = -1;

void push(int);
void pop();
void display();
void traverse();
void top();

int main()
{
	display();
	return 0;
}

void display()
{
	int opt;
	cout<<"\nChoose an option: \n\n1.Push\n2.Pop\n3.Traverse\n4.Top\n\nOption: ";
	cin>>opt;
	switch(opt)
	{
		case 1: cout<<"\n\nEnter value: ";
			int t;
			cin>>t;
			push(t);
			break;
		case 2: pop();
			break;
		case 3: traverse();
			break;
		case 4: top();
			break;
		default: cout<<"\n\n";
			display();
			break;
	}
}

void push(int v)
{
	if(head==MAX-1)
	{
		cout<<"\n\nStack Overflow!\n"<<endl;
		display();
	}

	a[++head] = v;
	display();
}

void pop()
{
	if(head==-1)
	{
		cout<<"\n\nStack Underflow!\n"<<endl;
		display();
	}

	head--;
	display();
}

void traverse()
{
	if(head==-1)
	{
		cout<<"\n\nStack Empty!\n"<<endl;
		display();
	}

	cout<<"\n\nNow Traversing: \n\n";
	for(int i=0; i<=head; i++) cout<<a[i]<<endl;
	display();
}

void top()
{
	if(head==-1)
	{
		cout<<"\n\nStack Empty!\n"<<endl;
		display();
	}

	cout<<"\n\n"<<a[head]<<endl;
	display();
}