-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDoubleLinkedListInsertion.cpp
157 lines (124 loc) · 2.38 KB
/
DoubleLinkedListInsertion.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
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
/**
* \file
* \brief
*
* \todo
*/
#include <iostream>
using namespace std;
struct Node {
int data;
Node* prev;
Node* next;
};
class DoubleLinkedList
{
Node *head;
public:
DoubleLinkedList() : head(NULL)
{}
//getter for head
Node* getHead();
//create a node
Node* createNode(int x);
//insert at beginning
void insertAtBeginning();
//insert at the end
void insertAtEnd();
//insert after a given node
void insertAfterAGivenNode(Node *n);
//Print the LinkedList
void display();
};
Node* DoubleLinkedList :: getHead()
{
return head;
}
Node* DoubleLinkedList :: createNode(int x)
{
struct Node* temp;
temp = new(struct Node);
if (temp == NULL)
{
cout << "Memory unavailable " << endl;
return NULL;
}
else
{
temp->data = x;
temp->prev = NULL;
temp->next = NULL;
return temp;
}
}
void DoubleLinkedList :: insertAtBeginning()
{
int value;
cout << "Enter the value to be inserted: ";
cin >> value ;
Node *temp;
temp = createNode(value);
temp->next = head;
if (head != NULL)
{
head->prev = temp;
}
head = temp;
}
void DoubleLinkedList :: insertAtEnd()
{
int value;
cout << "Enter the value to be inserted: ";
cin >> value ;
struct Node *temp, *begin;
temp = createNode(value);
if (head == NULL)
{
head = temp;
return;
}
begin = head;
while (begin->next != NULL)
{
begin = begin->next;
}
begin->next = temp;
temp->prev = begin;
return;
}
void DoubleLinkedList :: insertAfterAGivenNode(Node *prev)
{
int value;
cout << "Enter the value to be inserted: ";
cin >> value ;
Node *temp;
temp = createNode(value);
temp->next = prev->next;
prev->next = temp;
if (temp->next != NULL)
temp->next->prev = temp;
}
void DoubleLinkedList :: display()
{
Node* temp = new Node;
temp = head;
cout << "Displaying the linked list : " << ' ';
while (temp != NULL)
{
cout << temp->data << " ";
temp = temp->next;
}
cout << endl;
}
int main()
{
DoubleLinkedList l1;
l1.insertAtEnd();
l1.insertAtEnd();
l1.insertAtEnd();
l1.insertAtBeginning();
Node *head = l1.getHead();
l1.insertAfterAGivenNode(head->next->next);
l1.display();
return 0;
}