# JavaScript Exercises: Check if an element is present in a Doubly Linked lists

## JavaScript Data Structures: Exercise-13 with Solution

Write a JavaScript program to check if an element is present in 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
}

// Method to add a new node at the end of the list
if (this.head === null) { // Check if the list is empty
this.head = newNode; // If empty, set the new node as the head
this.tail = newNode; // Also set the new node as the tail
} else { // If list is not empty
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
}

// Method to check if a given value is present in the list
is_present(val) {
let current = this.head; // Start from the head of the list
while (current) { // Iterate through the list until reaching the end
if (current.value === val) { // Check if the value of the current node matches the given value
return true; // If found, return true
}
current = current.next; // Move to the next node
}
return false; // Return false if the value is not found in the list
}

// Method to print the values of the nodes in 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
}
}

// Create a new instance of the DoublyLinkedList class
// Add nodes to the list
numList.printList();
// Check if certain values are present in the list
result = numList.is_present(2);
console.log("Is 2 present in the said link list: " + result);
result = numList.is_present(7);
console.log("Is 7 present in the said link list: " + result);
result = numList.is_present(1);
console.log("Is 1 present in the said link list: " + result);
result = numList.is_present(9);
console.log("Is 9 present in the said link list: " + result);
```
```

Output:

```Original Doubly Linked Lists:
2 3 4 5 6 7
Is 2 present in the said link list: true
Is 7 present in the said link list: true
Is 1 present in the said link list: false
Is 9 present in the said link list: false
```

Flowchart:

Live Demo:

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

Improve this sample solution and post your code through Disqus

Linked List Previous: Get the index of a given element in a Doubly Linked lists.
Linked List Next: Remove a node at the specified index in a Doubly linked lists.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿