Alternating split of a given Singly Linked List | Set 1
Last Updated :
23 Jul, 2025
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 1(Simple)
The simplest approach iterates over the source list and pull nodes off the source and alternately put them at the front (or beginning) of 'a' and b'. The only strange part is that the nodes will be in the reverse order that occurred in the source list. Method 2 inserts the node at the end by keeping track of the last node in sublists.
C++
/* C++ Program to alternatively split
a linked list into two halves */
#include <bits/stdc++.h>
using namespace std;
/* Link list node */
class Node
{
public:
int data;
Node* next;
};
/* pull off the front node of
the source and put it in dest */
void MoveNode(Node** destRef, Node** sourceRef) ;
/* Given the source list, split its
nodes into two shorter lists. If we number
the elements 0, 1, 2, ... then all the even
elements should go in the first list, and
all the odd elements in the second. The
elements in the new lists may be in any order. */
void AlternatingSplit(Node* source, Node** aRef,
Node** bRef)
{
/* split the nodes of source
to these 'a' and 'b' lists */
Node* a = NULL;
Node* b = NULL;
Node* current = source;
while (current != NULL)
{
MoveNode(&a, ¤t); /* Move a node to list 'a' */
if (current != NULL)
{
MoveNode(&b, ¤t); /* Move a node to list 'b' */
}
}
*aRef = a;
*bRef = b;
}
/* Take the node from the front of
the source, and move it to the front
of the dest. It is an error to call
this with the source list empty.
Before calling MoveNode():
source == {1, 2, 3}
dest == {1, 2, 3}
After calling MoveNode():
source == {2, 3}
dest == {1, 1, 2, 3}
*/
void MoveNode(Node** destRef, Node** sourceRef)
{
/* the front source node */
Node* newNode = *sourceRef;
assert(newNode != NULL);
/* Advance the source pointer */
*sourceRef = newNode->next;
/* Link the old dest of the new node */
newNode->next = *destRef;
/* Move dest to point to the new node */
*destRef = newNode;
}
/* UTILITY FUNCTIONS */
/* Function to insert a node at
the beginning of the linked list */
void push(Node** head_ref, int new_data)
{
/* allocate node */
Node* new_node = new Node();
/* put in the data */
new_node->data = new_data;
/* link the old list of the new node */
new_node->next = (*head_ref);
/* move the head to point to the new node */
(*head_ref) = new_node;
}
/* Function to print nodes
in a given linked list */
void printList(Node *node)
{
while(node!=NULL)
{
cout<<node->data<<" ";
node = node->next;
}
}
/* Driver code*/
int main()
{
/* Start with the empty list */
Node* head = NULL;
Node* a = NULL;
Node* b = NULL;
/* Let us create a sorted linked list to test the functions
Created linked list will be 0->1->2->3->4->5 */
push(&head, 5);
push(&head, 4);
push(&head, 3);
push(&head, 2);
push(&head, 1);
push(&head, 0);
cout<<"Original linked List: ";
printList(head);
/* Remove duplicates from linked list */
AlternatingSplit(head, &a, &b);
cout<<"\nResultant Linked List 'a' : ";
printList(a);
cout<<"\nResultant Linked List 'b' : ";
printList(b);
return 0;
}
// This code is contributed by rathbhupendra
/*Program to alternatively split a linked list into two halves */
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
/* Link list node */
struct Node
{
int data;
struct Node* next;
};
/* pull off the front node of the source and put it in dest */
void MoveNode(struct Node** destRef, struct Node** sourceRef) ;
/* Given the source list, split its nodes into two shorter lists.
If we number the elements 0, 1, 2, ... then all the even elements
should go in the first list, and all the odd elements in the second.
The elements in the new lists may be in any order. */
void AlternatingSplit(struct Node* source, struct Node** aRef,
struct Node** bRef)
{
/* split the nodes of source to these 'a' and 'b' lists */
struct Node* a = NULL;
struct Node* b = NULL;
struct Node* current = source;
while (current != NULL)
{
MoveNode(&a, ¤t); /* Move a node to list 'a' */
if (current != NULL)
{
MoveNode(&b, ¤t); /* Move a node to list 'b' */
}
}
*aRef = a;
*bRef = b;
}
/* Take the node from the front of the source, and move it to the front of the dest.
It is an error to call this with the source list empty.
Before calling MoveNode():
source == {1, 2, 3}
dest == {1, 2, 3}
After calling MoveNode():
source == {2, 3}
dest == {1, 1, 2, 3}
*/
void MoveNode(struct Node** destRef, struct Node** sourceRef)
{
/* the front source node */
struct Node* newNode = *sourceRef;
assert(newNode != NULL);
/* Advance the source pointer */
*sourceRef = newNode->next;
/* Link the old dest of the new node */
newNode->next = *destRef;
/* Move dest to point to the new node */
*destRef = newNode;
}
/* UTILITY FUNCTIONS */
/* Function to insert a node at the beginning of the linked list */
void push(struct node** head_ref, int new_data)
{
/* allocate node */
struct Node* new_node =
(struct Node*) malloc(sizeof(struct Node));
/* put in the data */
new_node->data = new_data;
/* link the old list of the new node */
new_node->next = (*head_ref);
/* move the head to point to the new node */
(*head_ref) = new_node;
}
/* Function to print nodes in a given linked list */
void printList(struct Node *node)
{
while(node!=NULL)
{
printf("%d ", node->data);
node = node->next;
}
}
/* Driver program to test above functions*/
int main()
{
/* Start with the empty list */
struct Node* head = NULL;
struct Node* a = NULL;
struct Node* b = NULL;
/* Let us create a sorted linked list to test the functions
Created linked list will be 0->1->2->3->4->5 */
push(&head, 5);
push(&head, 4);
push(&head, 3);
push(&head, 2);
push(&head, 1);
push(&head, 0);
printf("\n Original linked List: ");
printList(head);
/* Remove duplicates from linked list */
AlternatingSplit(head, &a, &b);
printf("\n Resultant Linked List 'a' ");
printList(a);
printf("\n Resultant Linked List 'b' ");
printList(b);
getchar();
return 0;
}
import java.util.*;
// Linked list node
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
next = null;
}
}
class Main
{
// Given the source list, split its nodes into two shorter lists.
// All the even elements should go in the first list, and all the odd
// elements in the second. The elements in the new lists may be in any order.
static void AlternatingSplit(Node source, Node[] aRef, Node[] bRef) {
Node a = null, b = null;
Node current = source;
int count = 0;
while (current != null) {
if (count % 2 == 0) {
// Move a node to list 'a'
if (a == null) {
aRef[0] = current;
a = current;
} else {
a.next = current;
a = a.next;
}
} else {
// Move a node to list 'b'
if (b == null) {
bRef[0] = current;
b = current;
} else {
b.next = current;
b = b.next;
}
}
current = current.next;
count++;
}
if (a != null) {
a.next = null;
}
if (b != null) {
b.next = null;
}
}
// Function to print nodes in a given linked list
static void printList(Node node) {
while (node != null) {
System.out.print(node.data + " ");
node = node.next;
}
}
// Driver code
public static void main(String[] args)
{
// Start with the empty list
Node head = null;
// Let us create a sorted linked list to test the functions
// Created linked list will be 0->1->2->3->4->5
for (int i = 5; i >= 0; i--) {
Node newNode = new Node(i);
newNode.next = head;
head = newNode;
}
System.out.print("Original linked List: ");
printList(head);
Node[] aRef = new Node[1];
Node[] bRef = new Node[1];
// Remove duplicates from linked list
AlternatingSplit(head, aRef, bRef);
System.out.print("\nResultant Linked List 'a': ");
printList(aRef[0]);
System.out.print("\nResultant Linked List 'b': ");
printList(bRef[0]);
}
}
# Python program to alternatively split
# a linked list into two halves
# Node class
class Node:
def __init__(self, data, next = None):
self.data = data
self.next = None
class LinkedList:
def __init__(self):
self.head = None
# Given the source list, split its
# nodes into two shorter lists. If we number
# the elements 0, 1, 2, ... then all the even
# elements should go in the first list, and
# all the odd elements in the second. The
# elements in the new lists may be in any order.
def AlternatingSplit(self, a, b):
first = self.head
second = first.next
while (first is not None and
second is not None and
first.next is not None):
# Move a node to list 'a'
self.MoveNode(a, first)
# Move a node to list 'b'
self.MoveNode(b, second)
first = first.next.next
if first is None:
break
second = first.next
# Pull off the front node of the
# source and put it in dest
def MoveNode(self, dest, node):
# Make the new node
new_node = Node(node.data)
if dest.head is None:
dest.head = new_node
else:
# Link the old dest of the new node
new_node.next = dest.head
# Move dest to point to the new node
dest.head = new_node
# UTILITY FUNCTIONS
# Function to insert a node at
# the beginning of the linked list
def push(self, data):
# 1 & 2 allocate the Node &
# put the data
new_node = Node(data)
# Make the next of new Node as head
new_node.next = self.head
# Move the head to point to new Node
self.head = new_node
# Function to print nodes
# in a given linked list
def printList(self):
temp = self.head
while temp:
print temp.data,
temp = temp.next
print("")
# Driver Code
if __name__ == "__main__":
# Start with empty list
llist = LinkedList()
a = LinkedList()
b = LinkedList()
# Created linked list will be
# 0->1->2->3->4->5
llist.push(5)
llist.push(4)
llist.push(3)
llist.push(2)
llist.push(1)
llist.push(0)
llist.AlternatingSplit(a, b)
print "Original Linked List: ",
llist.printList()
print "Resultant Linked List 'a' : ",
a.printList()
print "Resultant Linked List 'b' : ",
b.printList()
# This code is contributed by kevalshah5
// C# program to alternatively split
// a linked list into two halves
using System;
using System.Collections.Generic;
public class Node{
public int data;
public Node next;
public Node(int item){
data = item;
next = null;
}
}
public class LinkedList{
Node head;
// Given the source list, split its
// nodes into two shorter lists. If we number
// the elements 0, 1, 2, ... then all the even
// elements should go in the first list, and
// all the odd elements in the second. The
// elements in the new lists may be in any order.
public void AlternatingSplit(LinkedList a, LinkedList b){
Node first = head;
Node second = first.next;
while(first != null && second != null && first.next != null)
{
// move a node to list 'a'
MoveNode(a, first);
// move a node to list 'b'
MoveNode(b, second);
first = first.next.next;
if(first == null)
break;
second = first.next;
}
}
// Pull off the front node of the
// source and put it in dest
public void MoveNode(LinkedList dest, Node node){
// Make the new node
Node new_node = new Node(node.data);
if(dest.head == null)
dest.head = new_node;
else{
// Link the old dest of the new node
new_node.next = dest.head;
// Move dest to point to the new node
dest.head = new_node;
}
}
// UTILITY FUNCTIONS
// Function to insert a node at
// the beginning of the linked list
void push(int data){
// 1 & 2 allocate the Node &
// put the data
Node new_node = new Node(data);
// Make the next of new Node as head
new_node.next = head;
// Move the head to point to new Node
head = new_node;
}
// Function to print nodes
// in a given linked list
public void printList(){
Node temp = head;
while(temp != null){
Console.Write(temp.data + " ");
temp = temp.next;
}
Console.WriteLine("");
}
public static void Main(string[] args){
LinkedList llist = new LinkedList();
LinkedList a = new LinkedList();
LinkedList b = new LinkedList();
// created linked list will be
// 0->1->2->3->4->5
llist.push(5);
llist.push(4);
llist.push(3);
llist.push(2);
llist.push(1);
llist.push(0);
llist.AlternatingSplit(a, b);
Console.WriteLine("Original Linked List : ");
llist.printList();
Console.WriteLine("Resultant Linked List 'a' : ");
a.printList();
Console.WriteLine("Resultant Linked List 'b' : ");
b.printList();
}
}
// THIS CODE IS CONTRIBUTED BY YASH AGARWAL(YASHAGAWRAL2852002)
<script>
// JavaScript program to alternatively split
// a linked list into two halves
// Node class
class Node{
constructor(data,next = null){
this.data = data
this.next = next
}
}
class LinkedList
{
constructor()
{
this.head = null
}
// Given the source list, split its
// nodes into two shorter lists. If we number
// the elements 0, 1, 2, ... then all the even
// elements should go in the first list, and
// all the odd elements in the second. The
// elements in the new lists may be in any order.
AlternatingSplit(a, b){
let first = this.head
let second = first.next
while (first != null &&
second != null &&
first.next != null){
// Move a node to list 'a'
this.MoveNode(a, first)
// Move a node to list 'b'
this.MoveNode(b, second)
first = first.next.next
if(first == null)
break
second = first.next
}
}
// Pull off the front node of the
// source and put it in dest
MoveNode(dest, node){
// Make the new node
let new_node = new Node(node.data)
if(dest.head == null)
dest.head = new_node
else{
// Link the old dest of the new node
new_node.next = dest.head
// Move dest to point to the new node
dest.head = new_node
}
}
// UTILITY FUNCTIONS
// Function to insert a node at
// the beginning of the linked list
push(data){
// 1 & 2 allocate the Node &
// put the data
let new_node = new Node(data)
// Make the next of new Node as head
new_node.next = this.head
// Move the head to point to new Node
this.head = new_node
}
// Function to print nodes
// in a given linked list
printList(){
let temp = this.head
while(temp){
document.write(temp.data," ");
temp = temp.next
}
document.write("</br>")
}
}
// Driver Code
// Start with empty list
let llist = new LinkedList()
let a = new LinkedList()
let b = new LinkedList()
// Created linked list will be
// 0->1->2->3->4->5
llist.push(5)
llist.push(4)
llist.push(3)
llist.push(2)
llist.push(1)
llist.push(0)
llist.AlternatingSplit(a, b)
document.write("Original Linked List: ");
llist.printList()
document.write("Resultant Linked List 'a' : ");
a.printList()
document.write("Resultant Linked List 'b' : ");
b.printList()
// This code is contributed by shinjanpatra
</script>
Output:
Original linked List: 0 1 2 3 4 5
Resultant Linked List 'a' : 4 2 0
Resultant Linked List 'b' : 5 3 1
Time Complexity: O(n)
where n is a number of nodes in the given linked list.
Auxiliary Space: O(1)
As constant extra space is used.
Method 2(Using Dummy Nodes)
Here is an alternative 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.
C++
void AlternatingSplit(Node* source,
Node** aRef, Node** bRef)
{
Node aDummy;
/* points to the last node in 'a' */
Node* aTail = &aDummy;
Node bDummy;
/* points to the last node in 'b' */
Node* bTail = &bDummy;
Node* current = source;
aDummy.next = NULL;
bDummy.next = NULL;
while (current != NULL)
{
MoveNode(&(aTail->next), ¤t); /* add at 'a' tail */
aTail = aTail->next; /* advance the 'a' tail */
if (current != NULL)
{
MoveNode(&(bTail->next), ¤t);
bTail = bTail->next;
}
}
*aRef = aDummy.next;
*bRef = bDummy.next;
}
// This code is contributed
// by rathbhupendra
void AlternatingSplit(struct Node* source, struct Node** aRef,
struct Node** bRef)
{
struct Node aDummy;
struct Node* aTail = &aDummy; /* points to the last node in 'a' */
struct Node bDummy;
struct Node* bTail = &bDummy; /* points to the last node in 'b' */
struct Node* current = source;
aDummy.next = NULL;
bDummy.next = NULL;
while (current != NULL)
{
MoveNode(&(aTail->next), ¤t); /* add at 'a' tail */
aTail = aTail->next; /* advance the 'a' tail */
if (current != NULL)
{
MoveNode(&(bTail->next), ¤t);
bTail = bTail->next;
}
}
*aRef = aDummy.next;
*bRef = bDummy.next;
}
static void AlternatingSplit(Node source, Node aRef,
Node bRef)
{
Node aDummy = new Node();
Node aTail = aDummy; /* points to the last node in 'a' */
Node bDummy = new Node();
Node bTail = bDummy; /* points to the last node in 'b' */
Node current = source;
aDummy.next = null;
bDummy.next = null;
while (current != null)
{
MoveNode((aTail.next), current); /* add at 'a' tail */
aTail = aTail.next; /* advance the 'a' tail */
if (current != null)
{
MoveNode((bTail.next), current);
bTail = bTail.next;
}
}
aRef = aDummy.next;
bRef = bDummy.next;
}
// This code is contributed by rutvik_56
def AlternatingSplit(source, aRef, bRef):
aDummy = Node();
aTail = aDummy; ''' points to the last Node in 'a' '''
bDummy = Node();
bTail = bDummy; ''' points to the last Node in 'b' '''
current = source;
aDummy.next = None;
bDummy.next = None;
while (current != None):
MoveNode((aTail.next), current); ''' add at 'a' tail '''
aTail = aTail.next; ''' advance the 'a' tail '''
if (current != None):
MoveNode((bTail.next), current);
bTail = bTail.next;
aRef = aDummy.next;
bRef = bDummy.next;
# This code is contributed by umadevi9616
static void AlternatingSplit(Node source, Node aRef,
Node bRef)
{
Node aDummy = new Node();
Node aTail = aDummy; /* points to the last node in 'a' */
Node bDummy = new Node();
Node bTail = bDummy; /* points to the last node in 'b' */
Node current = source;
aDummy.next = null;
bDummy.next = null;
while (current != null)
{
MoveNode((aTail.next), current); /* add at 'a' tail */
aTail = aTail.next; /* advance the 'a' tail */
if (current != null)
{
MoveNode((bTail.next), current);
bTail = bTail.next;
}
}
aRef = aDummy.next;
bRef = bDummy.next;
}
// This code is contributed by pratham_76
<script>
function AlternatingSplit( source, aRef,
bRef)
{
var aDummy = new Node();
var aTail = aDummy; /* points to the last node in 'a' */
var bDummy = new Node();
var bTail = bDummy; /* points to the last node in 'b' */
var current = source;
aDummy.next = null;
bDummy.next = null;
while (current != null)
{
MoveNode((aTail.next), current); /* add at 'a' tail */
aTail = aTail.next; /* advance the 'a' tail */
if (current != null)
{
MoveNode((bTail.next), current);
bTail = bTail.next;
}
}
aRef = aDummy.next;
bRef = bDummy.next;
}
// This code contributed by aashish1995
</script>
Time Complexity: O(n)
where n is number of node in the given linked list.
Auxiliary Space: O(1)
As Constant extra space is used.
Source: http://cslibrary.stanford.edu/105/LinkedListProblems.pdf
Please write comments if you find the above code/algorithm incorrect, or find better ways to solve the same problem.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem