Created
June 7, 2021 10:06
-
-
Save darshna09/73fe9161c96a7da7f3f1f5d903950f17 to your computer and use it in GitHub Desktop.
Doubly Linked List Implementation in JavaScript
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
class Node { | |
constructor(value) { | |
this.value = value; | |
this.next = null; | |
this.previous = null; | |
} | |
} | |
class DoublyLinkedList { | |
constructor(value) { | |
this.head = { | |
value: value, | |
next: null, | |
previous: null | |
}; | |
this.length = 1; | |
this.tail = this.head; | |
} | |
printList() { | |
let array = []; | |
let currentList = this.head; | |
while (currentList !== null) { | |
array.push(currentList.value); | |
currentList = currentList.next; | |
} | |
console.log(array.join(' <--> ')); | |
return this; | |
} | |
// Insert node at end of the list | |
append(value) { | |
let newNode = new Node(value); | |
this.tail.next = newNode; | |
newNode.previous = this.tail; | |
this.tail = newNode; | |
this.length++; | |
this.printList(); | |
} | |
// Insert node at the start of the list | |
prepend(value) { | |
let newNode = new Node(value); | |
newNode.next = this.head; | |
this.head.previous = newNode; | |
this.head = newNode; | |
this.length++; | |
this.printList(); | |
} | |
// Insert node at a given index | |
insert (index, value) { | |
if (!Number.isInteger(index) || index < 0 || index > this.length + 1) { | |
console.log(`Invalid index. Current length is ${this.length}.`); | |
return this; | |
} | |
// If index is 0, prepend | |
if (index === 0) { | |
this.prepend(value); | |
return this; | |
} | |
// If index is equal to this.length, append | |
if (index === this.length) { | |
this.append(value); | |
return this; | |
} | |
// Reach the node at that index | |
let newNode = new Node(value); | |
let previousNode = this.head; | |
for (let k = 0; k < index - 1; k++) { | |
previousNode = previousNode.next; | |
} | |
let nextNode = previousNode.next; | |
newNode.next = nextNode; | |
previousNode.next = newNode; | |
newNode.previous = previousNode; | |
nextNode.previous = newNode; | |
this.length++; | |
this.printList(); | |
} | |
// Remove a node | |
remove (index) { | |
if (!Number.isInteger(index) || index < 0 || index > this.length) { | |
console.log(`Invalid index. Current length is ${this.length}.`); | |
return this; | |
} | |
// Remove head | |
if (index === 0) { | |
this.head = this.head.next; | |
this.head.previous = null; | |
this.length--; | |
this.printList(); | |
return this; | |
} | |
// Remove tail | |
if (index === this.length - 1) { | |
this.tail = this.tail.previous; | |
this.tail.next = null; | |
this.length--; | |
this.printList(); | |
return this; | |
} | |
// Remove node at an index | |
let previousNode = this.head; | |
for (let k = 0; k < index - 1; k++) { | |
previousNode = previousNode.next; | |
} | |
let deleteNode = previousNode.next; | |
let nextNode = deleteNode.next; | |
previousNode.next = nextNode; | |
nextNode.previous = previousNode; | |
this.length--; | |
this.printList(); | |
return this; | |
} | |
} | |
let myDoublyList = new DoublyLinkedList(10); | |
myDoublyList.append(5); // 10 <--> 5 | |
myDoublyList.append(16); // 10 <--> 5 <--> 16 | |
myDoublyList.prepend(1); // 1 <--> 10 <--> 5 <--> 16 | |
myDoublyList.insert(2, 99); // 1 <--> 10 <--> 99 <--> 5 <--> 16 | |
myDoublyList.insert(20, 88); // Invalid index. Current length is 5. | |
myDoublyList.insert(5, 80); // 1 <--> 10 <--> 99 <--> 5 <--> 16 <--> 80 | |
myDoublyList.insert(0, 80); // 80 <--> 1 <--> 10 <--> 99 <--> 5 <--> 16 <--> 80 | |
myDoublyList.remove(0); // 1 <--> 10 <--> 99 <--> 5 <--> 16 <--> 80 | |
myDoublyList.remove(5); // 1 <--> 10 <--> 99 <--> 5 <--> 16 | |
myDoublyList.remove(2); // 1 <--> 10 <--> 5 <--> 16 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment