Scribd
Upload
11 views1 page

Javascript Code

The document defines a DoublyLinkedList class with methods to insert and remove nodes from both ends of the list. It uses dummy head and tail nodes to simplify edge case handling. The class also includes a method to print the list's contents in a readable format.

Uploaded by

samarthkindle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
11 views1 page

Javascript Code

The document defines a DoublyLinkedList class with methods to insert and remove nodes from both ends of the list. It uses dummy head and tail nodes to simplify edge case handling. The class also includes a method to print the list's contents in a readable format.

Uploaded by

samarthkindle
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

class DoublyListNode {

constructor (val) {
this.val = val;
this.next = null;
}
}

// Implementation for Doubly Linked List


class DoublyLinkedList {
constructor() {
// Init the list with 'dummy' head and tail nodes which makes
// edge cases for insert & remove easier.
this.head = new DoublyListNode(-1);
this.tail = new DoublyListNode(-1);
this.head.next = this.tail;
this.tail.prev = this.head;
}

insertFront(val) {
const newNode = new DoublyListNode(val);
newNode.prev = this.head;
newNode.next = this.head.next;

this.head.next.prev = newNode;
this.head.next = newNode;
}

insertEnd(val) {
const newNode = new DoublyListNode(val);
newNode.next = this.tail;
newNode.prev = this.tail.prev;

this.tail.prev.next = newNode;
this.tail.prev = newNode;
}

// Remove first node after dummy head (assume it exists)


removeFront() {
this.head.next.next.prev = this.head;
this.head.next = this.head.next.next;
}

// Remove last node before dummy tail (assume it exists)


removeEnd() {
this.tail.prev.prev.next = this.tail;
this.tail.prev = this.tail.prev.prev;
}

print() {
let curr = this.head.next;
let s = "";
while (curr != this.tail) {
s+= curr.val + "->";
curr = curr.next;
}
console.log(s);
}
}

You might also like