-
Notifications
You must be signed in to change notification settings - Fork 0
/
stacks_using_linked_lists.c
70 lines (62 loc) · 1.02 KB
/
stacks_using_linked_lists.c
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
#include<stdio.h>
#include<stdlib.h>
struct stack{
int value;
struct stack *NEXT;
}*top;
typedef struct stack stack;
void push(int ele){
stack *ptr=(stack *)malloc(sizeof(stack));
ptr->value=ele;
ptr->NEXT=top;
top=ptr;
}
void pop(){
if(top==NULL){
printf("stack is empty\n");
}
else{
top=top->NEXT;
}
}
void display(){
stack *ptr= NULL;
ptr=top;
if(top==NULL){
printf("stack is empty\n");
}
else{
printf("stack is \n");
while(ptr!=NULL){
printf("%d\n",ptr->value);
ptr=ptr->NEXT;
}
}
}
void main(){
while(1){
printf("enter 1 to push an element\n");
printf("enter 2 to pop an element\n");
printf("enter 3 to display\n");
printf("enter 4 to exit\n");
int choice;
scanf("%d",&choice);
switch(choice){
case 1:
printf("enter element\n");
int b;
scanf("%d",&b);
push(b);
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
exit(1);
break;
}
}
}