-
Notifications
You must be signed in to change notification settings - Fork 0
/
DoubleLinkedList.cpp
78 lines (72 loc) · 1.58 KB
/
DoubleLinkedList.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
#include "DoubleLinkedList.h"
#include "Node.h"
#include <iostream>
DoubleLinkedList::DoubleLinkedList(int data)
{
this->head = new Node(data);
}
DoubleLinkedList::~DoubleLinkedList()
{
if (this->head != nullptr)
{
delete this->head;
this->head = nullptr;
}
}
void DoubleLinkedList::append(int data)
{
if (head != nullptr) // if list not empty
{
Node* current = head;
while (current->next != nullptr)
{
current = current->next;
}
Node* node = new Node(data);
node->prev = current;
current->next = node;
return;
}
return;
}
void DoubleLinkedList::reverse()
{
if (this->head != nullptr)
{
Node* current = this->head;
while (current->next != nullptr)
{
Node* temp = current->prev;
current->prev = current->next;
current->next = temp;
current = current->prev;
}
Node* temp = current->prev;
current->prev = current->next;
current->next = temp;
this->head = current;
return;
}
return;
}
void DoubleLinkedList::printLeftToRight()
{
if (head != nullptr)
{
if (head->next == nullptr)
{
std::cout << head->data;
std::cout << "\n";
return;
}
Node* current = head;
while (current->next != nullptr)
{
std::cout << current->data << " ";
current = current->next;
}
std::cout << current->data << "\n";
return;
}
return;
}