-
Notifications
You must be signed in to change notification settings - Fork 0
/
dll-at-mid.c
81 lines (71 loc) · 1.28 KB
/
dll-at-mid.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
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *prev;
struct node * next;
}*p,*head,*new;
void create(int n);
void insertatmid(int d,int pos);
void display();
int main()
{
int n,d,pos;
printf("enter no of nodes:");
scanf("%d",&n);
create(n);
scanf("%d",&d);
scanf("%d",&pos);
insertatmid(d,pos);
display();
}
void create(int n)
{
int data,i;
head=(struct node*)malloc(sizeof(struct node));
p=head;
printf("enter node 1:");
scanf("%d",&data);
head->data=data;
head->prev=NULL;
head->next=NULL;
for(i=2;i<=n;i++)
{
printf("enter node %d",i);
new = (struct node *)malloc(sizeof(struct node));
scanf("%d",&data);
new->data=data;
new->prev=p;
new->next=NULL;
p->next=new;
p=p->next;
}
}
void insertatmid(int d,int pos)
{
int i;
p=head;
for(i=1;i<pos-1;i++)
{
p=p->next;
}
new=(struct node*)malloc(sizeof(struct node));
new->data=d;
new->next=p->next;
new->prev=p;
if(p->next!=NULL)
{
p->next->prev=new;
}
p->next=new;
}
void display()
{
p=head;
while(p!=NULL)
{
printf("%d->",p->data);
p=p->next;
}
}