Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Linked List representation in Javascript
Linked List is an ordered collection of data elements. In linked list the data will be represented in Nodes. Node has two parts, the first part will be holding the data of the element and second part of the node (pointer) will store the address of the very next node. In linked list elements are stored in a sequential manner.
Operations in Linked List
There are several operations in Linked list, which are adding a node, deleting a node and searching a node. which are detailed in the below scenarios.
Creating a Node
Let’s see the scenario of linked list node below −
//Creating a node
class Node {
constructor(element){
this.element = element,
this.next = null // next of the node will be NULL.
}
}
In the above scenario, we have created a Node which has two properties: element and next. Element holds the data of the node and the second property "next" will holds the pointer referring to the next node. In above example next is referring to NULL because there is only node in linked list.
Creating a Linked list class
Below is the method to create a linked list class −
class LinkedList{
//Creates a linkedlist with passed element.
constructor(element){
//Creating HeadNode of Linkedlist
this.head_of_LL = {
element: element,
next : null
};
//Length of Linkedlist is 1
this.length = 1;
}
}
In the above snippet, we have created a linked list class that will perform adding, deleting and searching the nodes. And the length of this list is defined as 1, as there is only one node in the linked list (head is also the last node).
Adding Node at Beginning
Following is the algorithm to add node at head of the Linked List −
- Create a New node by creating instance of node class.
- Point New node’s next to the head.
- Now, make New node as head.
The following is the method to add a node at head position −
//ADDING node at head position in Linkedlist
Add_node(element){
//Creating New node
const newNode = new Node(element);
//Points this node's next to the head of next node
newNode.next = this.head_of_LL;
//Make this node as Head node
this.head_of_LL = newNode;
//Increase the length
this.length++;
return this;
}
Deleting a node at Beginning
Following is the algorithm to delete node at head of the Linked List −
- Make the very next element of deleted element as head.
- Now, decrease the length of Linked list by 1.
This is the method below to delete a node at head position −
delete_head_node(){
//Next node of head will become new headnode
this.head_of_LL = this.head_of_LL.next;
//removing the node
this.length--;
}
Here, we are performing to delete the element at head position in linked list. The next node of deleted element will become the new head and length of the linked list will reduce by 1.
Searching an element
Following is the algorithm to search for an element in the Linked List −
Traverse the entire linked list.
- Now, Compare the values
- Return true, if found
- Else, return false.
The below scenario is searching an element in the linked list −
search_Node(element){
let curr_Node = this.head_of_LL;
//TRAVERSE the list and compare the values
while(curr_Node !== null){
if(curr_Node.element === element)
//returns true if value is present
return true;
curr_Node = curr_Node.next;
}
// returns false if not found
return false;
}
Implementation of Linked list
We are implementing a Linked List data structure in JavaScript. In Linked List we can perform the operations like adding and deleting the elements, searching an element. In the code below we have implemented all the above mentioned operations.
Example
Let’s look into the final execution of code below −
<!DOCTYPE html> <html> <title>implementation of linked_list in JavaScript</title> <head> <script> class Node { constructor(element) { this.element = element, this.next = null } } class LinkedList { //Creates a linkedlist with passed element. constructor(element) { this.head_of_LL = { element: element, next: null }; this.length = 1; } // ADDING A NODE Add_node(element) { const newNode = new Node(element); newNode.next = this.head_of_LL; this.head_of_LL = newNode; this.length++; return this; } // DELETING A NODE delete_head_node() { this.head_of_LL = this.head_of_LL.next; this.length--; } //SEARCHING A NODE search_Node(element) { let curr_Node = this.head_of_LL; while (curr_Node !== null) { if (curr_Node.element === element) return true; curr_Node = curr_Node.next; } return false; } getLinkedlist() { let getArrayList = []; let curr_Node = this.head_of_LL; while (curr_Node !== null) { getArrayList.push(curr_Node.element); curr_Node = curr_Node.next; } return getArrayList.join(' → '); } } document.write("Creating a LL with node 44:"); document.write("<br>"); const myLinkedList = new LinkedList(44); document.write(myLinkedList.getLinkedlist()); document.write("<br>"); //Adding document.write('Adding nodes (33, 22 and 11) at head position :'); myLinkedList.Add_node(11); myLinkedList.Add_node(22); myLinkedList.Add_node(33); document.write("<br>"); document.write(myLinkedList.getLinkedlist()); document.write("<br>"); //Deleting document.write('Deleting (32) node at head position :'); myLinkedList.delete_head_node(); document.write("<br>"); document.write(myLinkedList.getLinkedlist()); document.write("<br>"); //Searching document.write('Searching for element 11 :'); document.write("<br>"); document.write(myLinkedList.getLinkedlist()); document.write("<br>"); document.write(myLinkedList.search_Node(11)); document.write("<br>"); document.write('Searching for element 55 :'); document.write("<br>"); document.write(myLinkedList.getLinkedlist()); document.write("<br>"); document.write(myLinkedList.search_Node(55)); </script> </head> </html>
Output
The output of the above script will be −
Creating a LL with node 44: 44 Adding nodes (33, 22 and 11) at head position : 33 → 22 → 11 → 44 Deleting (32) node at head position : 22 → 11 → 44 Searching for element 11 : 22 → 11 → 44 true Searching for element 55 : 22 → 11 → 44 false
162 Views
