-
Notifications
You must be signed in to change notification settings - Fork 11
/
Insert_after_node.c
96 lines (87 loc) · 2.16 KB
/
Insert_after_node.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
#include <stdio.h>
#include <stdlib.h>
struct DLL{
int data;
struct DLL *next;
struct DLL *prev;
};
struct DLL *head = NULL;
void insertion_last()
{
struct DLL *ptr,*temp;
int item;
ptr = (struct DLL *) malloc(sizeof(struct DLL));
if(ptr == NULL)
{
printf("\nOVERFLOW");
}
else
{
printf("\nEnter value");
scanf("%d",&item);
ptr->data=item;
if(head == NULL)
{
ptr->next = NULL;
ptr->prev = NULL;
head = ptr;
}
else
{
temp = head;
while(temp->next!=NULL)
{
temp = temp->next;
}
temp->next = ptr;
ptr ->prev=temp;
ptr->next = NULL;
}
}
printf("\nnode inserted\n");
}
//insert after specific node
void insert_after_node(int data, int data_after){
struct DLL *temp = head;
while(temp != NULL){
if(temp->data == data_after){
struct DLL *ptr = (struct DLL *)malloc(sizeof(struct DLL));
ptr->data = data;
ptr->next = temp->next;
ptr->prev = temp;
temp->next = ptr;
if(ptr->next != NULL){
ptr->next->prev = ptr;
}
break;
}
temp = temp->next;
}
}
void main(){
int n;
printf("Enter the number of nodes you want to insert: ");
scanf("%d", &n);
for(int i=0; i<n; i++){
insertion_last();
}
//PRINT ELEMENTS OF NODE
struct DLL *temp = head;
while(temp != NULL){
printf("%d ", temp->data);
temp = temp->next;
}
printf("\n");
int data, data_after;
printf("Enter the data to be inserted: ");
scanf("%d", &data);
printf("Enter the data after which you want to insert: ");
scanf("%d", &data_after);
insert_after_node(data, data_after);
printf("\n");
temp = head;
while(temp != NULL){
printf("%d ", temp->data);
temp = temp->next;
}
}