-
Notifications
You must be signed in to change notification settings - Fork 46
/
Copy pathlinked-list-double.js
115 lines (105 loc) · 1.99 KB
/
linked-list-double.js
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
class Node {
constructor(value) {
this.value = value;
this.prev = null;
this.next = null;
}
}
class DoublyLinkedList {
constructor() {
this.head = null;
this.tail = null;
this.size = 0;
}
isEmpty() {
return this.size === 0;
}
getSize() {
return this.size;
}
prepend(value) {
const node = new Node(value);
if (this.isEmpty()) {
this.head = node;
this.tail = node;
} else {
node.next = this.head;
this.head.prev = node;
this.head = node;
}
this.size++;
}
append(value) {
const node = new Node(value);
if (this.isEmpty()) {
this.head = node;
this.tail = node;
} else {
this.tail.next = node;
node.prev = this.tail;
this.tail = node;
}
this.size++;
}
removeFromFront() {
if (this.isEmpty()) {
return null;
}
const value = this.head.value;
this.head = this.head.next;
this.size--;
return value;
}
removeFromEnd() {
if (this.isEmpty()) {
return null;
}
const value = this.tail.value;
if (this.size === 1) {
this.head = null;
this.tail = null;
} else {
this.tail = this.tail.prev;
this.tail.next = null;
}
this.size--;
return value;
}
print() {
if (this.isEmpty()) {
console.log("List is empty");
} else {
let curr = this.head;
let list = "";
while (curr) {
list += `${curr.value}<->`;
curr = curr.next;
}
console.log(list);
}
}
printReverse() {
if (this.isEmpty()) {
console.log("List is empty");
} else {
let curr = this.tail;
let list = "";
while (curr) {
list += `${curr.value}<->`;
curr = curr.prev;
}
console.log(list);
}
}
}
const list = new DoublyLinkedList();
list.append(1);
list.append(2);
list.append(3);
list.prepend(0);
list.print();
list.printReverse();
list.removeFromEnd();
list.print();
list.removeFromFront();
list.print();