forked from ashwin-nair98/ds_lab
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdouble_linked_menu.c
More file actions
107 lines (98 loc) · 2.09 KB
/
double_linked_menu.c
File metadata and controls
107 lines (98 loc) · 2.09 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
106
107
#include<stdio.h>
#include <stdlib.h>
struct node {
int data;
struct node *prev;
struct node *next;
};
struct node *head;
struct node *temp;
void insertFirst(int data) {
struct node *link = (struct node*) malloc(sizeof(struct node));
link->data = data;
link->next = head->next;
link->prev = head;
head->next = link;
}
void insertAtPos(int data, int pos)
{
struct node *link = (struct node*) malloc(sizeof(struct node));
int i;
link->data = data;
temp = head->next;
for(i=0;i<pos-1;i++)
temp=temp->next;
link->next = temp->next;
link->prev = temp;
temp->next = link;
temp->next->prev = link;
}
void insertAtEnd(int data)
{
struct node *link = (struct node*) malloc(sizeof(struct node));
temp = head;
while(temp->next!=NULL) temp = temp->next;
link->data = data;
link->prev = temp;
link->next = NULL;
temp->next = link;
}
void delete(int data)
{
struct node *temp = (struct node*) malloc(sizeof(struct node));
temp = head;
while(temp->next!=NULL)
{ if(temp->next->data == data)
{ temp->next = temp->next->next;
temp->next->prev = temp;
break;
}
temp = temp->next;
}
}
void display()
{
temp = head->next;
while(temp!=NULL)
{ printf("Data: %d\n",temp->data);
temp = temp->next;
}
}
int main()
{
head = (struct node*) malloc(sizeof(struct node));
head->next = NULL;
head->prev = NULL;
int ch, dat, pos;
do{
printf("1.Add node at front\n2.Add node at position\n3.Add node at end\n4.Delete node\n5.Display\n6.Exit\nEnter choice: ");
scanf("%d", &ch);
switch(ch)
{
case 1: printf("Enter data: ");
scanf("%d", &dat);
insertFirst(dat);
break;
case 2: printf("Enter data: ");
scanf("%d", &dat);
printf("Enter position: ");
scanf("%d", &pos);
insertAtPos(dat, pos);
break;
case 3: printf("Enter data: ");
scanf("%d", &dat);
insertAtEnd(dat);
break;
case 4: printf("Enter data in node to delete: ");
scanf("%d", &dat);
delete(dat);
break;
case 5: display();
break;
case 6: printf("Exiting..\n");
break;
default:printf("Invalid choice!\n");
break;
}
}while(ch!=6);
}