forked from AASF-IIITM/algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
StackUsingLinkedList.c
89 lines (82 loc) · 1.16 KB
/
StackUsingLinkedList.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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include<stdio.h>
#include<stdlib.h>
#include<malloc.h>
struct node{
int val;
struct node *next;
}*top=NULL;
int PUSH()
{
int value;
struct node *current=(struct node*)malloc(sizeof(struct node));
printf("\nEnter data : ");
scanf("%d", &value);
current->val=value;
if(top==NULL)
{
top=current;
current->next=NULL;
}
else
{
current->next=top;
top=current;
}
return 0;
}
int POP()
{
struct node *temp=top;
if(top==NULL)
{
printf("\nStack is empty!\n");
return 0;
}
else
{
top=top->next;
}
printf("\n The value to be deleted is %d \n",temp->val);
free(temp);
}
void Traverse()
{
struct node *temp=top;
if(top==NULL)
{
printf("\nStack is empty!\n");
}
else
{
printf("\nStack displayed is:\n");
while(temp!=NULL)
{
printf(" %d -> ",temp->val);
temp=temp->next;
}
printf("NULL\n");
}
}
int main()
{
int n;
while(1)
{
printf("\nEnter 1 for PUSH\nEnter 2 for POP\nEnter 3 for TRAVERSE\nEnter 4 for EXIT ");
scanf("%d",&n);
switch(n)
{
case 1: PUSH();
break;
case 2: POP();
break;
case 3: Traverse();
break;
case 4: exit(0);
break;
default:
printf("\nINVALID INPUT!");
}
}
return 0;
}