-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDoublyLinkedList.cpp
128 lines (106 loc) · 2.27 KB
/
DoublyLinkedList.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
#include <iostream>
using namespace std;
class Node // class to create a node
{
public:
int data;
Node *next;
Node *prev;
Node(int val)
{
data = val;
next = prev = NULL;
}
};
class DoublyList // class to add, delete, print and search nodes
{
Node *head;
Node *tail;
public:
DoublyList()
{
head = tail = NULL;
}
void push_front(int val) // add node on front of linked list
{
Node *newNode = new Node(val);
if (head == NULL) // empty linked list
{
head = tail = newNode;
return;
}
else // not empty
{
newNode->next = head;
head->prev = newNode;
head = newNode;
}
}
void push_back(int val) // add node on back or end of linked list
{
Node *newNode = new Node(val);
if (head == NULL) // empty linked list
{
head = tail = newNode;
return;
}
else // not empty
{
newNode->prev = tail;
tail->next = newNode;
tail = newNode;
}
}
void pop_front() // delete node from front of linked list
{
if (head == NULL) // empty linked list
{
cout << "DLL is empty\n";
return;
}
Node *temp = head;
head = head->next;
if (head != NULL)
{
head->prev = NULL;
}
temp->next = NULL;
delete temp;
}
void pop_back() // delete node from back or end of linked list
{
if (head == NULL) // empty linked list
{
cout << "DLL is empty\n";
return;
}
Node *temp = tail;
tail = tail->prev;
if (tail != NULL)
{
tail->next = NULL;
}
temp->prev = NULL;
delete temp;
}
void printLL() // to print linked list
{
Node *temp = head;
while (temp != NULL)
{
cout << temp->data << " <=> ";
temp = temp->next;
}
cout << "NULL" << endl;
}
};
int main()
{
DoublyList dll;
dll.push_back(1);
dll.push_back(2);
dll.push_back(3);
dll.pop_back();
dll.printLL();
return 0;
}