-
Notifications
You must be signed in to change notification settings - Fork 0
/
pro11doublelinkedlist.c
110 lines (110 loc) · 2.36 KB
/
pro11doublelinkedlist.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
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
int data;
struct node *next;
struct node *prev;
}Node;
Node *head=NULL;
void insert(int data,int key);
void delete(int data);
void display();
int main()
{
int choice;
int value,key=-1;
while(1)
{
printf("\n***MENU****\n");
printf("\n1.Insert");
printf("\n2.Delete");
printf("\n3.Display");
printf("\n4.Exit");
printf("\nEnter your choice:");
scanf("%d",&choice);
switch(choice)
{
case 1:printf("Enter the value to be inserted:");
scanf("%d",&value);
if(head!=NULL)
{
printf("Enter the Key:");
scanf("%d",&key);
}
insert(value,key);
break;
case 2:printf("Enter the value to be deleted:");
scanf("%d",&value);
delete(value);
break;
case 3:display();break;
case 4:exit(0);
default:printf("Invalid choice\n");
}
}
}
void insert(int data,int key)
{
Node *newNode=(Node *)malloc(sizeof(Node));
newNode->data=data;
newNode->prev=NULL;
newNode->next=NULL;
if(head==NULL)
{
head=newNode;
return;
}
Node *current=head;
while(current!=NULL && current->data!=key)
current=current->next;
if(current==NULL)
{
printf("Key not found\n");
return;
}
newNode->prev=current->prev;
current->prev=newNode;
newNode->next=current;
if(newNode->prev!=NULL)
newNode->prev->next=newNode;
else
head=newNode;
}
void delete(int data)
{
Node*temp=head,*prev=NULL,*next=NULL;
while(temp!=NULL && temp->data!=data)
{
prev=temp;
temp=temp->next;
}
if(temp==NULL)
{
printf("Data not found.\n");
return ;
}
next=temp->next;
if(prev==NULL)
head=next;
else
prev->next=next;
if(next!=NULL)
{
next->prev=prev;
}
free(temp);
}
void display()
{
Node *ptr=head;
if(head==NULL)
{
printf("List is empty\n");
}
printf("\nList:");
while(ptr!=NULL)
{
printf("%d\t",ptr->data);
ptr=ptr->next;
}
}