-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack_linkedlist.c
More file actions
108 lines (93 loc) · 2.42 KB
/
stack_linkedlist.c
File metadata and controls
108 lines (93 loc) · 2.42 KB
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
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int data;
struct Node *next;
};
typedef struct Node node;
node *getNode()
{
int ele;
node *newnode;
newnode=(node*)malloc(sizeof(node));
printf("Enter the data to be stored in the newnode\n");
scanf("%d",&ele);
newnode->data=ele;
newnode->next=NULL;
return newnode;
}
node *head=NULL;
void DisplayList()
{
if(head==NULL)
printf("Empty Stack");
else{
node *temp;
temp=head;
while(temp!=NULL)
{
printf("%d \n",temp->data);
temp=temp->next;
}
free (temp);
}
}
void InsertNodeFront() //Inserting the elements of the stack
{
node *newnode=getNode();
newnode->next=head;
head=newnode;
}
void DeleteNodeFront() //Popping of elements of stack
{
if(head==NULL)
printf("Empty stack\n");
else{
node *temp;
temp=head;
head=head->next;
free (temp);
}
}
int main()
{
printf("Enter the elements of the stack and then enter 4\n");
int choice=0;
while(choice!=4)
{
printf("\nEnter choice\n");
printf("Enter 1 to push an element to the stack \n");
printf("Enter 2 to pop an element from the stack \n");
printf("Enter 3 to display the stack \n");
printf("Enter 4 to complete entering the stack\n");
scanf("%d",&choice);
switch(choice)
{
case 1:
{
InsertNodeFront();
DisplayList();
break;
}
case 2:
{
DeleteNodeFront();
DisplayList();
break;
}
case 3:
{
DisplayList();
break;
}
case 4:break;
default:
{
printf("EXIT");
break;
}
}
}
return 0;
}