Repository navigation
Expand file tree
/
Copy pathstackWll.c
More file actions
112 lines (101 loc) · 1.84 KB
/
Copy pathstackWll.c
File metadata and controls
112 lines (101 loc) · 1.84 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
109
110
111
112
#include <stdio.h>
#include <stdlib.h>
struct Stack
{
int data;
struct Stack *next;
};
struct Stack *top = NULL;
// Push Operation
void push()
{
int x;
printf("Enter Element to be pushed\n");
scanf("%d", &x);
struct Stack *newNode = (struct Stack *)malloc(sizeof(struct Stack));
newNode->data = x;
newNode->next = top;
top = newNode;
}
// Pop Operation
void pop()
{
struct Stack *temp = (struct Stack *)malloc(sizeof(struct Stack));
temp = top;
if (top == NULL)
{
printf("Stack is empty\n");
}
else
{
printf("Popped Element is %d\n", top->data);
top = top->next;
free(temp);
}
}
// Peek Operation
void peek()
{
if (top == NULL)
{
printf("Stack is empty\n");
}
else
{
printf("Top element is %d\n", top->data);
}
}
// Display
void display()
{
struct Stack *temp = (struct Stack *)malloc(sizeof(struct Stack));
temp = top;
if (top == NULL)
{
printf("Stack is empty\n");
}
else
{
while (temp != NULL)
{
printf("%d ", temp->data);
temp = temp->next;
}
}
printf("\n");
}
int main()
{
int opt;
while (1)
{
printf("which operation do you want to perform?\n");
printf("1.Push\n");
printf("2.Pop\n");
printf("3.Peek\n");
printf("4.Display\n");
printf("5.Exit\n");
scanf("%d", &opt);
switch (opt)
{
case 1:
push();
break;
case 2:
pop();
break;
case 3:
peek();
break;
case 4:
display();
break;
case 5:
exit(0);
break;
default:
printf("Unknown operation\n");
}
}
return 0;
}