-
Notifications
You must be signed in to change notification settings - Fork 0
/
Doubly Linked List.c
120 lines (112 loc) · 2.51 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
#include<stdio.h>
#include<stdlib.h>
struct node {
int data;
struct node *next;
struct node *prev;
};
struct node *head = NULL;
struct node *p = NULL;
void showDoubbleLinkedList(){
p = head;
printf("Linked list is : \n");
while(p != NULL){
printf("%d \n", p->data);
p = p -> next;
}
}
void createDoubbleLinkedList(int n){
int i;
for(i=1; i<=n; i++) {
struct node *new = (struct node *)malloc(sizeof(struct node));
new -> next = NULL;
new -> prev = NULL;
printf("Enter the %d node data : \n", i);
scanf("%d", &(new->data));
if(head == NULL){
head = new;
p = head;
} else {
p -> next = new;
new -> prev = p;
p = p -> next;
}
}
showDoubbleLinkedList();
}
void InsertAtBeginning(){
p = head;
struct node *new = (struct node *)malloc(sizeof(struct node));
new->next = NULL;
new->prev = NULL;
printf("Enter the node data for the beginning : \n");
scanf("%d", &(new->data));
if(head == NULL){
head = new;
p = head;
}
else {
new->next = p;
p->prev = new;
head = new;
p = head;
}
showDoubbleLinkedList();
}
void InsertAtEnd(){
p = head;
struct node *new = (struct node *)malloc(sizeof(struct node));
new->next = NULL;
new->prev = NULL;
printf("Enter the node data for end : \n");
scanf("%d", &(new->data));
if(head == NULL){
head = new;
p = head;
}
else {
while(p->next != NULL){
p = p->next;
}
p->next = new;
new->prev = p;
p = p->next;
}
showDoubbleLinkedList();
}
void InsertAtIntermidiate(int pos) {
int i;
p = head;
struct node *new = (struct node *)malloc(sizeof(struct node));
new->next = NULL;
new->prev = NULL;
printf("Enter the Intermediate node data : \n");
scanf("%d", &(new->data));
if(head == NULL){
head = new;
p = head;
}
else {
for(i=1; i<pos-1; i++){
p = p->next;
}
new->next = p->next;
p->next->prev = new;
p->next = new;
new->prev = p;
}
showDoubbleLinkedList();
}
int main ()
{
int n, pos;
printf("Enter the number of nodes : \n ");
scanf("%d", &n);
createDoubbleLinkedList(n);
InsertAtBeginning();
InsertAtEnd();
printf("Enter the position where the node will be inserted : \n ");
scanf("%d", &pos);
InsertAtIntermidiate(pos);
return 0;
}