-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLab3.c
More file actions
108 lines (107 loc) · 2 KB
/
Copy pathLab3.c
File metadata and controls
108 lines (107 loc) · 2 KB
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
#include <stdlib.h>
#include <stdio.h>
#define MAX 5
int stack[MAX], top = -1, item;
void push() // Inserting element into the stack
{
if (top == (MAX - 1))
{
printf("Stack Overflow!!\n");
}
else
{
printf("Enter the element to be inserted: ");
scanf("%d", &item);
stack[++top] = item;
}
}
void pop() // deleting an element from the stack
{
if (top == -1)
{
printf("Stack Underflow!!\n");
}
else
{
item = stack[top--];
printf("The popped element: %d\n", item);
}
}
void display()
{
int i;
if (top == -1)
{
printf("Stack is Empty\n");
}
else
{
printf("The stack elements are:\n");
for (i = top; i >= 0; i--)
{
printf("%d\n", stack[i]);
}
}
}
void palindrome()
{
int j = top, k = 0, flag = 0;
if (top == -1)
{
printf("Stack is empty.\n");
return;
}
while (k <= top / 2)
{
if (stack[k++] != stack[j--])
{
flag = 1;
break;
}
}
if (flag)
{
printf("Stack contents are not a palindrome\n");
}
else
{
printf("Stack contents are palindrome\n");
}
}
main()
{
int choice;
while (1)
{
choice = 0;
printf("--------STACK OPERATIONS-----------\n");
printf("1.Push\n");
printf("2.Pop\n");
printf("3.Palindrome\n");
printf("4.Display\n");
printf("5.Exit\n");
printf("-----------------------------------\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice)
{
case 1:
push();
break;
case 2:
pop();
break;
case 3:
palindrome();
break;
case 4:
display();
break;
case 5:
exit(0);
default:
printf("Invalid choice:\n");
return;
}
}
}