forked from ambujraj/hacktoberfest2018
-
Notifications
You must be signed in to change notification settings - Fork 1
/
StackUsingLinkedList.c
108 lines (101 loc) · 1.69 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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
#include <stdio.h>
struct node
{
int info;
struct node* link;
};
int isEmpty(struct node* top)
{
return (top == NULL);
}
int peek(struct node* top)
{
if (isEmpty(top))
{
printf("Stack Underflow\n");
return;
}
return top->info;
}
void push(struct node** top, int item)
{
struct node *tmp;
tmp= (struct node *)malloc(sizeof(struct node));
if (tmp==NULL)
{
printf("Stack Overflow\n");
return;
}
tmp->info=item;
tmp->link=*top;
*top=tmp;
}
int pop(struct node** top)
{
int item;
struct node* tmp;
if (isEmpty(*top))
{
printf("Stack Underflow\n");
return;
}
tmp=*top;
item=tmp->info;
*top=(*top)->link;
free(tmp);
return item;
}
void display(struct node* top)
{
struct node* ptr;
ptr=top;
if (isEmpty(top))
{
printf("Stack is empty\n");
return;
}
printf("Stack elements are: \n");
while (ptr!=NULL)
{
printf("%d\n",ptr->info);
ptr=ptr->link;
}
printf("\n");
}
int main()
{
struct node *top=NULL;
int choice,item;
while (1)
{
printf("1. Push\n");
printf("2. Pop\n");
printf("3. Display item at top\n");
printf("4. Display all items of stack\n");
printf("5. Quit\n");
scanf("%d",&choice);
switch (choice)
{
case 1:
printf("Enter the item to be pushed : ");
scanf("%d",&item);
push(&top,item);
break;
case 2:
item=pop(&top);
printf("Popped item is : %d\n", item);
break;
case 3:
printf("Item at the top is : %d\n", peek(top));
break;
case 4:
display(top);
break;
case 5:
exit(1);
default:
printf("Please enter a choice from 1 to 4\n");
}
}
return 0;
}