-
Notifications
You must be signed in to change notification settings - Fork 1
/
doublyLL.cpp
69 lines (63 loc) · 1.28 KB
/
doublyLL.cpp
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
#include<iostream>
using namespace std;
class node{
public:
int data;
node* next;
node* pre;
node(int value){
data=value;
next=NULL;
pre=NULL;
}
};
void insertAtTail(node* &head,int value){
node* n=new node(value);
if(head==NULL){
head=n;
return;
}
node* temp=head;
while(temp->next!=NULL)temp=temp->next;
temp->next=n;
n->pre=temp;
}
void insertAtHead(node* &head,int value){
node* n=new node(value);
n->next=head;
if(head!=NULL)head->pre=n;
head=n;
}
void deletion(node* &head,int pos){
node* temp=head;
if(pos==1){
head=temp->next;
if(head!=NULL)head->pre=NULL;
delete temp;
return;
}
for(int i=1;i<pos-1;i++)temp=temp->next;
node* todelete = temp->next;
temp->next=temp->next->next;
if(temp->next->next!=NULL)temp->next->next->pre=temp;
delete todelete;
}
void display(node* &head){
node* temp=head;
while(temp!=NULL){
cout<<temp->data<<" ";
temp=temp->next;
}
cout<<endl;
}
int main(){
node* head=NULL;
insertAtTail(head,10);
insertAtTail(head,20);
insertAtTail(head,30);
insertAtHead(head,-10);
insertAtHead(head,0);
deletion(head,2);
display(head);
return 0;
}