-
Notifications
You must be signed in to change notification settings - Fork 0
/
Stack_Using_Linked_List.c
88 lines (88 loc) · 1.54 KB
/
Stack_Using_Linked_List.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
//C program to implement stack using linked list.
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct node
{
int value;
struct node *link;
}*top;
void push();
void pop();
void display();
int main()
{
system("cls");
int choice;
char c[10];
top=NULL;
do
{
printf("\t STACK USING LINKED LIST\n");
printf("1.PUSH\n2.POP\n3.DISPLAY\n0.EXIT\n");
printf("Enter your Choice : ");
scanf("%d",&choice);
switch(choice)
{
case 1 : push();
break;
case 2 : pop();
break;
case 3 : display();
break;
case 0 : exit(0);
default: printf("\nInvalid Input");
}
printf("Do you want to continue(y/n) : ");
scanf("%s",c);
}while(strcmpi(c,"Y")==0||strcmpi(c,"y")==0);
return 0;
}
void push()
{
struct node *temp;
temp=(struct node*)malloc(sizeof(struct node));
if(temp==NULL)
{
printf("\nOverflow\n");
}
else
{
printf("Enter the data : ");
scanf("%d",&temp->value);
temp->link=top;
top=temp;
}
}
void pop()
{
if(top==NULL)
{
printf("\nUnderFlow\n");
}
else
{
struct node *temp=top;
top=top->link;
free(temp);
}
}
void display()
{
if(top==NULL)
{
printf("\nUnderFlow\n");
}
else
{
struct node *temp;
temp=top;
printf("\nStack Contents :");
while(temp!=NULL)
{
printf("%d\t",temp->value);
temp=temp->link;
}
}
printf("\n");
}