-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinsert_doubly_LL.cpp
More file actions
89 lines (71 loc) · 1.4 KB
/
insert_doubly_LL.cpp
File metadata and controls
89 lines (71 loc) · 1.4 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
#include<bits/stdc++.h>
using namespace std;
class Node{
public:
Node *prev;
int data;
Node *next;
};
Node *head;
create_dub_ll(int A[],int s){
head=new Node;
Node *temp;
Node *last;
head->prev= NULL;
head->data=A[0];
head->next=NULL;
last=head;
for (int i = 1; i < s; i++)
{
temp = new Node;
temp->prev=head;
temp->data=A[i];
temp->next=NULL;
last->next=temp;
last=temp;
}
}
// insert at a given index
void Insert_at_index(Node* P,int key,int pos){
if (pos < 0) {
cout << "Invalid position\n";
return;
}
Node* q = new Node;
q->data = key;
if(pos == 0){
q->next = head;
head->prev = q;
head=q;
}
else{
for (int i = 0; i < pos - 1 && P; i++) {
P = P->next;
}
if (!P) {
cout << "Invalid position\n";
return;
}
q->next = P->next;
q->prev=P;
if(P->next){
P->next->prev=q;
}
P->next=q;
}
}
Node display(Node *p){
while (p!=NULL)
{
cout<<p->prev<<"-"<<p->data<<"-"<<p->next<<"-> ";
p=p->next;
}
}
int main(){
int A[]={1,2,3,4,5,6};
int size=(sizeof(A)/sizeof(A[0]));
create_dub_ll(A,size);
Insert_at_index(head,7,6);
display(head);
return 0;
}