-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist.js
81 lines (67 loc) · 1.57 KB
/
linkedlist.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
function createNode(value) {
return {
value: value,
next: null,
};
}
class LinkedList {
constructor() {
this.head = null;
this.tail = null;
this.length = 0;
}
insert(value) {
this.length++;
let node = createNode(value); // or use new Node(value);
if (this.tail) {
this.tail.next = node;
this.tail = node;
return node.value;
}
this.head = this.tail = node;
return node.value;
}
insertHead(value) {
this.length++;
let node = createNode(value);
if (this.head) {
node.next = this.head;
this.head = node;
return node.value;
}
this.head = this.tail = node;
return node.value;
}
removeHead() {
if (this.head) {
this.length--;
const removedNode = this.head;
this.head = this.head.next;
return removedNode.value;
}
return undefined;
}
remove() {
if (this.tail) {
this.length--;
const tailNode = this.tail;
// search for the node before tail
let currentNode = this.head;
while (currentNode.next != tailNode) {
currentNode = currentNode.next;
}
const beforeTail = currentNode;
this.tail = beforeTail;
this.tail.next = null;
return tailNode.value;
}
return undefined;
}
print() {
let current = this.head;
while (current) {
console.log(current.value);
current = current.next;
}
}
}