Javascript Program For Alternating Split Of A Given Singly Linked List- Set 1 Last Updated : 06 Sep, 2024 Comments Improve Suggest changes Like Article Like Report Write a function AlternatingSplit() that takes one list and divides up its nodes to make two smaller lists 'a' and 'b'. The sublists should be made from alternating elements in the original list. So if the original list is 0->1->0->1->0->1 then one sublist should be 0->0->0 and the other should be 1->1->1.Method (Using Dummy Nodes): Here is an approach that builds the sub-lists in the same order as the source list. The code uses temporary dummy header nodes for the 'a' and 'b' lists as they are being built. Each sublist has a "tail" pointer that points to its current last node — that way new nodes can be appended to the end of each list easily. The dummy nodes give the tail pointers something to point to initially. The dummy nodes are efficient in this case because they are temporary and allocated in the stack. Alternately, local "reference pointers" (which always point to the last pointer in the list instead of to the last node) could be used to avoid Dummy nodes. JavaScript // Node class to create a new node in the linked list class Node { constructor(data) { this.data = data; this.next = null; } } // Linked List class class LinkedList { constructor() { this.head = null; } // Method to add a new node at the end of the list append(data) { let newNode = new Node(data); if (this.head === null) { this.head = newNode; } else { let current = this.head; while (current.next !== null) { current = current.next; } current.next = newNode; } } // Method to print the linked list printList() { let current = this.head; let result = ''; while (current !== null) { result += current.data + ' '; current = current.next; } console.log(result.trim()); } } // Function to move the front node from the source list to the destination list function MoveNode(destRef, sourceRef) { if (sourceRef.head === null) return; // Take the node from the front of the source let newNode = sourceRef.head; sourceRef.head = sourceRef.head.next; // Move the node to the front of the destRef list newNode.next = destRef.head; destRef.head = newNode; } // Function to split the linked list into two alternating lists function AlternatingSplit(source, aRef, bRef) { let current = source.head; // Alternate between adding nodes to 'aRef' and 'bRef' while (current !== null) { // Move the node to 'aRef' MoveNode(aRef, source); // If the current node is not null, move the next node to 'bRef' if (source.head !== null) { MoveNode(bRef, source); } current = source.head; // Update current to the new head of the source } } // Create a linked list let sourceList = new LinkedList(); // Add nodes to the source list sourceList.append(1); sourceList.append(2); sourceList.append(3); sourceList.append(4); sourceList.append(5); sourceList.append(6); // Create references for the new lists let aRef = new LinkedList(); let bRef = new LinkedList(); // Print the original list console.log("Original list:"); sourceList.printList(); // Perform alternating split AlternatingSplit(sourceList, aRef, bRef); // Print the split lists console.log("List A:"); aRef.printList(); console.log("List B:"); bRef.printList(); OutputOriginal list: 1 2 3 4 5 6 List A: 5 3 1 List B: 6 4 2 Complexity Analysis:Time Complexity: O(n) where n is number of node in the given linked list.Space Complexity: O(1), because we just use some variables.Please refer complete article on Alternating split of a given Singly Linked List | Set 1 for more details! Comment More infoAdvertise with us Next Article Javascript Program For Alternating Split Of A Given Singly Linked List- Set 1 kartik Follow Improve Article Tags : Linked List JavaScript Web Technologies DSA Linked Lists +1 More Practice Tags : Linked List Similar Reads JavaScript Linked List Programs JavaScript Linked List Programs contain a list of articles based on programming. Linked List is a linear data structure that stores data in linearly connected nodes. Linked lists store elements sequentially, but doesn’t store the elements contiguously like an array. S. NoArticles1JavaScript Program 5 min read Implementation of LinkedList in Javascript In this article, we will be implementing the LinkedList data structure in Javascript.A linked list is a linear data structure where elements are stored in nodes, each containing a value and a reference (or pointer) to the next node. It allows for efficient insertion and deletion operations.Each node 5 min read Javascript Program For Searching An Element In A Linked List Write a function that searches a given key 'x' in a given singly linked list. The function should return true if x is present in linked list and false otherwise.bool search(Node *head, int x) For example, if the key to be searched is 15 and linked list is 14->21->11->30->10, then functio 3 min read Javascript Program For Inserting A Node In A Linked List We have introduced Linked Lists in the previous post. We also created a simple linked list with 3 nodes and discussed linked list traversal.All programs discussed in this post consider the following representations of the linked list. JavaScript// Linked List Class // Head of list let head; // Node 7 min read Javascript Program For Inserting Node In The Middle Of The Linked List Given a linked list containing n nodes. The problem is to insert a new node with data x at the middle of the list. If n is even, then insert the new node after the (n/2)th node, else insert the new node after the (n+1)/2th node.Examples: Input : list: 1->2->4->5 x = 3Output : 1->2->3- 4 min read Javascript Program For Writing A Function To Delete A Linked List A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers. This article focuses on writing a function to delete a linked list.Implementation: JavaScript// Javascript program to delete // a li 1 min read Javascript Program For Deleting A Linked List Node At A Given Position Given a singly linked list and a position, delete a linked list node at the given position.Example: Input: position = 1, Linked List = 8->2->3->1->7Output: Linked List = 8->3->1->7Input: position = 0, Linked List = 8->2->3->1->7Output: Linked List = 2->3->1- 3 min read Javascript Program For Finding Length Of A Linked List Write a function to count the number of nodes in a given singly linked list.For example, the function should return 5 for linked list 1->3->1->2->1.Iterative Solution: 1) Initialize count as 0 2) Initialize a node pointer, current = head.3) Do following while current is not NULL a) curre 3 min read Javascript Program For Rotating A Linked List Given a singly linked list, rotate the linked list counter-clockwise by k nodes. Where k is a given positive integer. For example, if the given linked list is 10->20->30->40->50->60 and k is 4, the list should be modified to 50->60->10->20->30->40. Assume that k is smal 5 min read Javascript Program For Making Middle Node Head In A Linked List Given a singly linked list, find middle of the linked list and set middle node of the linked list at beginning of the linked list. Examples:Input: 1 2 3 4 5 Output: 3 1 2 4 5Input: 1 2 3 4 5 6Output: 4 1 2 3 5 6 The idea is to first find middle of a linked list using two pointers, first one moves on 3 min read Like