w3resource

JavaScript Exercises: Get the index of a given element in a Doubly Linked lists

JavaScript Data Structures: Exercise-12 with Solution

Get the index of an element in a DLL

Write a JavaScript program to get the index of an element 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
	}
}

class DoublyLinkedList {
	// 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
		this.head = {
			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
	add(newNode) {
		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 find the index of a given element in the list
	index_of(el) {
		let current = this.head; // Start from the head of the list
		let index = 0; // Initialize the index counter
		while (current) { // Iterate through the list until reaching the end
			if (current.value === el) { // Check if the value of the current node matches the given element
				return index; // If found, return the current index
			}
			current = current.next; // Move to the next node
			index++; // Increment the index counter
		}
		return -1; // Return -1 if the element 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
let numList = new DoublyLinkedList();
// Add nodes to the list
numList.add(new Node(2));
numList.add(new Node(3));
numList.add(new Node(4));
numList.add(new Node(5));
numList.add(new Node(6));
numList.add(new Node(7));
console.log("Original Doubly Linked Lists:");
numList.printList();
// Find the index of certain elements in the list
result = numList.index_of(2);
console.log("Index of 2 in the said link list: " + result);
result = numList.index_of(7);
console.log("Index of 7 in the said link list: " + result);
result = numList.index_of(1);
console.log("Index of 1 in the said link list: " + result);
result = numList.index_of(9);
console.log("Index of 9 in the said link list: " + result);

Output:

Original Doubly Linked Lists:
 2 3 4 5 6 7
Index of 2 in the said link list: 1
Index of 7 in the said link list: 6
Index of 1 in the said link list: -1
Index of 9 in the said link list: -1 

Flowchart:

Flowchart: JavaScript Exercises: Get index of an element in a Doubly Linked lists.
Flowchart: JavaScript Exercises: Get index of an element in a Doubly Linked lists.

Live Demo:

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


Improve this sample solution and post your code through Disqus

Linked List Previous: Convert a Doubly Linked lists into a string.
Linked List Next: Check if an element is present in a Doubly Linked lists.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.



Become a Patron!

Follow us on Facebook and Twitter for latest update.

It will be nice if you may share this link in any developer community or anywhere else, from where other developers may find this content. Thanks.

https://www.w3resource.com/javascript-exercises/linkedlist/javascript-doubly-linked-list-exercise-12.php