-
Notifications
You must be signed in to change notification settings - Fork 1
/
doubly_linked_list.c
182 lines (166 loc) · 4.18 KB
/
doubly_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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct NODE
{
char name[100],dept[100],ssn[100],desgn[100],phno[100],sal[100];
struct NODE *llink;
struct NODE *rlink;
};
typedef struct NODE *Nodeptr;
Nodeptr first=NULL,temp,ptr,prev,newnode;
int n,ch,i,count;
Nodeptr create_node()
{
newnode=(Nodeptr)malloc(sizeof(struct NODE));
printf("\nEnter the Employee SSN:\n");
scanf("%s",newnode->ssn);
printf("Enter the Employee Name:\n");
scanf("%s",newnode->name);
printf("Enter the Employee Department:\n");
scanf("%s",newnode->dept);
printf("Enter the Employee Designation:\n");
scanf("%s",newnode->desgn);
printf("Enter the Employee Salary:\n");
scanf("%s",newnode->sal);
printf("Enter the Employee Phone No:\n");
scanf("%s",newnode->phno);
newnode->rlink=NULL;
newnode->llink=NULL;
return newnode;
}
void insert_front()
{
temp=create_node();
if(first==NULL)
first=temp;
temp->rlink=first;
first->llink=temp;
first=temp;
}
void delete_front()
{
ptr=first;
if(first==NULL)
printf("List is Empty.\n");
else if(first->rlink==NULL)
{
first=NULL;
free(ptr);
printf("Front node deleted successfully.\n");
}
else
{
first=ptr->rlink;
ptr->rlink=NULL;
first->llink=NULL;
free(ptr);
printf("Front node deleted successfully.\n");
}
}
void insert_end()
{
temp=create_node();
ptr=first;
if(first==NULL)
first=temp;
else
{
while(ptr->rlink!=NULL)
ptr=ptr->rlink;
ptr->rlink=temp;
temp->llink=ptr;
}
}
void delete_end()
{
ptr=first;
if(first==NULL)
printf("List is Empty.\n");
else if(first->rlink==NULL)
{
first=NULL;
free(ptr);
printf("End node deleted successfully.\n");
}
else
{
while(ptr->rlink!=NULL)
{
prev=ptr;
ptr=ptr->rlink;
}
prev->rlink=NULL;
ptr->llink=NULL;
free(ptr);
printf("End node deleted successfully.\n");
}
}
void display()
{
count=0;
ptr=first;
if(first==NULL)
printf("List is Empty.\n");
else
{
printf("\n<-:The DDL values are:->");
while(ptr!=NULL)
{
printf("\nSSN:%s\nName:%s\nDepartment:%s\nDesignation:%s\nSalary:%s\nPh NO:%s\n",ptr->ssn,ptr->name,ptr->dept,ptr->desgn,ptr->sal,ptr->phno);
ptr=ptr->rlink;
count++;
}
printf("\nNODE COUNT='%d'.\n",count);
}
}
int main()
{
while(1)
{
printf("\n<-:Doubly Linked List Operations Menu:->\n");
printf("1. Create a DLL of N Students Data by using front insertion\n2. Display the status of DLL\n3. Insertion / Deletion at End of DLL\n4. Insertion / Deletion at Front of DLL\n5. Exit\nEnter your choice:\n");
scanf("%d",&ch);
switch(ch)
{
case 1: printf("Enter the value of N to create DLL:\n");
scanf("%d",&n);
for(i=1;i<=n;i++)
{
printf("Enter a %d node to insert towards end of DLL:\n",i);
insert_end();
}
break;
case 2: display();
break;
case 3: printf("Press 1 to Insert End or 2 to Delete End:\n");
scanf("%d",&ch);
if(ch==1)
{
printf("Enter a node to insert towards end of DLL:\n");
insert_end();
}
else if(ch==2)
delete_end();
else
printf("Invalid Entry.\n");
break;
case 4: printf("Press 1 to Insert Front or 2 to Delete Front:\n");
scanf("%d",&ch);
if(ch==1)
{
printf("Enter a node to insert to Front of DLL:\n");
insert_front();
}
else if(ch==2)
delete_front();
else
printf("Invalid Entry.\n");
break;
case 5: exit(0);
default: printf("Enter the valid choice.\n\n");
break;
}
}
return 0;
}