# JavaScript Exercises: Remove the head element from a doubly Linked lists

## JavaScript Data Structures: Exercise-15 with Solution

Write a JavaScript program that removes the head element from a doubly Linked lists.

Sample Solution:

JavaScript Code:

``````class Node {
// Constructor function for creating a new node with a given value
constructor(value) {
this.value = value; // Assign the given value to the node
this.next = null; // Initialize the pointer to the next node as null
this.previous = null; // Initialize the pointer to the previous node as null
}
}
// Constructor function for creating a new doubly linked list with a head node having the given value
constructor(value) {
// Initialize the head node with the given value and no next or previous node
value: value, // Store the value of the head node
next: null, // Pointer to the next node in the list, initially set to null
previous: null // Pointer to the previous node in the list, initially set to null
};
this.length = 0; // Initialize the length of the list to 0
this.tail = this.head; // Set the tail node to the head node initially
}
this.head = newNode; // If the list is empty, set the new node as both head and tail
this.tail = newNode;
}
else
{
newNode.previous = this.tail; // Set the previous pointer of the new node to the current tail node
this.tail.next = newNode; // Set the next pointer of the current tail node to the new node
this.tail = newNode; // Update the tail node to the new node
}
this.length++; // Increment the length of the list
}
if (!this.head) { // If the list is empty, return null
return null;
}
if (!this.head.next) { // If there is only one node in the list
this.tail = null; // Also set tail to null
return;
}
this.head.previous = null; // Set the previous pointer of the new head to null
this.length--; // Decrement the length of the list
}
printList(){
let current = this.head; // Start from the head of the list
let result = []; // Array to store the values of the nodes
while (current !== null) { // Iterate through the list until reaching the end
result.push(current.value); // Push the value of the current node to the array
current = current.next; // Move to the next node
}
console.log(result.join(' ')); // Log the values of the nodes separated by space
return this; // Return the DoublyLinkedList object for chaining
}
}
let numList = new DoublyLinkedList(); // Create a new instance of the DoublyLinkedList class
console.log("Original Doubly Linked Lists:"); // Print the original list
numList.printList();
numList.printList();
numList.printList();
```
```

Output:

```Original Doubly Linked Lists:
2 3 4 5 6 7
2 3 4 5 6 7
3 4 5 6 7
```

Flowchart:

Live Demo:

See the Pen javascript-doubly-linked-list-exercise-15 by w3resource (@w3resource) on CodePen.

Improve this sample solution and post your code through Disqus

Linked List Previous: Remove a node at the specified index in a Doubly linked lists.
Linked List Next: Remove the tail element from a doubly Linked lists.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿