JavaScript program deletes spare nodes of linked list

We will write a JavaScript program to delete the spare node of the linked list. We will use a while loop to traverse the linked list, keeping track of the current and previous nodes. On each iteration of the loop, we will skip the current node and link the previous node directly to the next node, effectively removing the current node from the list. This process will be repeated until all replacement nodes have been removed from the linked list.

method

• Traverse the linked list from beginning to end.

• For each node, store its next node.

• Delete the node next to the current node.

• Update the next reference of the current node to the next of the next node.

• Move to the next node, which is now the next of the next node.

• Repeat this process until the end of the linked list is reached.

• Finally, after deleting all spare nodes, return the head of the linked list.

Example

This is a complete example of deleting a linked list replacement node in JavaScript -

// Linked List Node
class Node {
   constructor(data) {
      this.data = data;
      this.next = null;
   }
}

// Linked List class
class LinkedList {
   constructor() {
      this.head = null;
   }
   
   // Method to delete alternate nodes
   deleteAlternate() {
      let current = this.head;
      while (current !== null && current.next !== null) {
         current.next = current.next.next;
         current = current.next;
      }
   }
   
   // Method to print the linked list
   printList() {
      let current = this.head;
      while (current !== null) {
         console.log(current.data);
         current = current.next;
      }
   }
}
// create a linked list
let list = new LinkedList();
list.head = new Node(1);
list.head.next = new Node(2);
list.head.next.next = new Node(3);
list.head.next.next.next = new Node(4);
list.head.next.next.next.next = new Node(5);
console.log("Linked List before deleting alternate nodes: ");
list.printList();
list.deleteAlternate();
console.log("Linked List after deleting alternate nodes: ");
list.printList();

illustrate

• We first create a Node class to represent each node in the linked list, which contains a data field and a next pointing to the list The fields of the next node.

• Then, we create a LinkedList class that contains the head node of the linked list and a printList method to print the linked list.

The
• deleteAlternate

  method of the LinkedList class is used to delete alternative nodes in the linked list. This method iterates the linked list and updates each node's next pointer to point to the next node in the linked list, effectively removing the alternate node.

• Finally, we create a linked list and print it before and after deleting the alternate node.

The above is the detailed content of JavaScript program deletes spare nodes of linked list. For more information, please follow other related articles on the PHP Chinese website!