Repository navigation
Expand file tree
/
Copy pathlinkedlistdouble.cpp
More file actions
199 lines (159 loc) · 3.65 KB
/
Copy pathlinkedlistdouble.cpp
File metadata and controls
199 lines (159 loc) · 3.65 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
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
#include <iostream>
using namespace std;
class Node {
public:
int data;
Node* prev;
Node* next;
// constructor
Node(int d){
this -> data = d;
this -> prev = NULL;
this -> next = NULL;
}
// destructor
~Node(){
int val = this -> data;
if (this->next!=NULL){
delete next;
next = NULL;
}
cout<< "Memeory free for node with data "<< val<<endl;
}
};
void print(Node* head){
Node* temp = head;
while (temp != NULL)
{
cout<<temp -> data<<" ";
temp = temp -> next;
}
cout<<endl;
}
// Gives the length of the linked list
int getLength(Node* head){
int len = 0;
Node* temp = head;
while (temp != NULL)
{
len++;
temp = temp -> next;
}
return len;
}
// Inserting at head
void insertAtHead(Node* &tail,Node* &head,int d){
// Empty list
if (head == NULL)
{
Node* temp = new Node(d);
head = temp;
tail = temp;
}
else{
Node* temp = new Node(d);
// new element k next ko head m point karwa do
temp -> next = head;
// head k previous ko new element par point karwa denge
head -> prev = temp;
head = temp;
}
}
void insertAtTail(Node* &tail,Node* &head,int d){
// Empty list
if (tail == NULL)
{
Node* temp = new Node(d);
tail = temp;
head = temp;
}
else{
// Create
Node* temp = new Node(d);
tail -> next = temp;
temp -> prev = tail;
tail = temp;
}
}
void insertAtPosition(Node* &tail,Node* &head,int position,int d){
// Insert at start
if(position == 1){
insertAtHead(tail,head,d);
return ;
}
Node* temp = head;
int cnt = 1;
while (cnt < position-1)
{
temp = temp -> next;
cnt++;
}
// Inserting at the last position
if (temp -> next == NULL)
{
insertAtTail(tail,head,d);
return ;
}
// Inserting at any other position
Node* nodeToInsert = new Node(d);
// Adjusting all 4 pointers .
nodeToInsert -> next = temp -> next;
temp -> next -> prev = nodeToInsert;
temp->next = nodeToInsert;
nodeToInsert -> prev = temp;
}
// Deleting a node
void deleteNode(int position,Node* &head,Node* &tail){
// deleting first or start node .
if (position == 1)
{
Node* temp = head;
temp -> next -> prev = NULL;
head = temp -> next;
temp -> next = NULL;
delete temp;
}
// deleting at any other or last position .
else
{
Node* curr = head;
Node* prev = NULL;
int cnt = 1;
while (cnt<position)
{
prev = curr;
curr = curr -> next;
cnt++;
}
// If deletion is at the last.
if (curr -> next == NULL)
{
tail = curr -> prev;
}
curr -> prev = NULL;
prev -> next = curr -> next;
curr ->next = NULL;
delete curr;
}
}
int main(){
// Node* node1 = new Node(10);
Node* head = NULL;
Node* tail = NULL;
// cout<< getLength(head) <<endl;
insertAtHead(tail,head,11);
insertAtHead(tail,head,17);
insertAtHead(tail,head,44);
insertAtHead(tail,head,55);
insertAtHead(tail,head,1);
insertAtHead(tail,head,66);
insertAtHead(tail,head,99);
insertAtHead(tail,head,204);
print(head);
insertAtTail(tail,head,300);
print(head);
deleteNode(9,head,tail);
print(head);
cout<<tail->data;
return 0;
}