forked from Manupriya-Vayalambron/Data-Structures
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdoublylinked.c
151 lines (133 loc) · 2.01 KB
/
doublylinked.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
#include<stdlib.h>
#include<stdio.h>
typedef struct node
{
int value;
struct node *left;
struct node *right;
}node;
node* createhead()
{
node *head;
head=malloc(sizeof(node));
head->left=head->right=NULL;
return head;
}
node* createnode()
{
node *newnode;
newnode=malloc(sizeof(node));
return newnode;
}
void insertfirst(node *head,int data)
{
node *newnode=createnode();
newnode->value=data;
if(head->right==NULL)
{
head->right=newnode;
newnode->right=NULL;
}
else
{
newnode->right=head->right;
head->right=newnode;
}
}
void insertlast(node *head,int data)
{
node *current=head->right;
while(current->right!=NULL)
{
current=current->right;
}
node *newnode=createnode();
newnode->value=data;
newnode->right=NULL;
newnode->left=current;
current->right=newnode;
printf("%d inserted\n",data);
}
void deletelast(node *head)
{
if(head->right ==NULL)
{
printf("Deletion not possible\n");
}
else
{
node *current=head->right;
node *prev=current;
while(current->right!=NULL)
{
prev=current;
current=current->right;
}
printf("%d deleted\n",current->value);
prev->right=NULL;
}
}
void deletefirst(node *head)
{
if(head->right ==NULL)
{
printf("Deletion not possible\n");
}
else
{
printf("%d deleted\n",(head->right)->value);
head->right=(head->right)->right;
}
}
void display(node *head)
{
node *current=head->right;
while(current!=NULL)
{
printf("%d",current->value);
current=current->right;
if(current!=NULL)
{
printf("->");
}
}
}
int main()
{
node *head=createhead();
int data,ch,key;
while (1)
{
printf("\n1. InsertFirst\n2. InsertLast\n3. DeleteFirst\n4. DeleteLast\n5. Display\n6. Exit\n");
printf("Enter the choice: ");
scanf("%d",&ch);
switch(ch)
{
case 1:
printf("Enter the value: ");
scanf("%d",&data);
insertfirst(head,data);
break;
case 2:
printf("Enter the value: ");
scanf("%d",&data);
insertlast(head,data);
break;
case 3:
deletefirst(head);
break;
case 4:
deletelast(head);
break;
case 5:
display(head);
break;
case 6:
exit(0);
break;
default:
printf("Invalid choice");
exit(0);
}
}
}