-
Notifications
You must be signed in to change notification settings - Fork 1
/
12.stackUsingLL.c
88 lines (80 loc) · 1.24 KB
/
12.stackUsingLL.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
/*
Author : abhijithvijayan
Title : Stack using Linked List
*/
#include <stdio.h>
#include <stdlib.h>
int userInput();
struct Node
{
int data;
struct Node *link;
};
struct Node *top;
void push()
{
int item = userInput();
struct Node *temp = (struct Node *)malloc(sizeof(struct Node));
temp->data = item;
temp->link = top;
top = temp;
}
void pop()
{
if (top == NULL)
{
printf("The Stack is already empty\n");
}
else
{
struct Node *newptr = top;
top = newptr->link;
free(newptr);
}
}
void view()
{
if (top == NULL)
printf("Empty List\n\n");
else
{
struct Node *newptr = top;
printf("\nThe list is...\n");
while (newptr != NULL) //careful
{
printf("%d ", newptr->data);
newptr = newptr->link;
}
printf("\n\n");
}
}
int userInput()
{
int item;
printf("Enter the element:");
scanf("%d", &item);
return item;
}
void main()
{
system("clear");
int ch;
top == NULL;
do
{
printf("\n---Operations Menu---\n");
printf("1.Push\n2.Pop\n\nEnter your choice# ");
scanf("%d", &ch);
switch (ch)
{
case 1:
push();
view();
break;
case 2:
pop();
view();
break;
}
} while (ch < 3);
}