Convert singly linked list into circular linked list
Last Updated :
12 Sep, 2024
Given a singly linked list, the task is to convert it into a circular linked list.
Examples:
Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> NULL
Output:
Explanation: Singly linked list is converted to circular by pointing last node to head.
Input: head: 2 -> 4 -> 6 -> 8 -> 10 -> 12 -> NULL
Output:
Explanation: Singly linked list is converted to circular by pointing last node to head.
[Expected Approach - 1] Using Recursion - O(n) Time and O(n) Space:
To convert a singly linked list into a circular linked list using recursion, begin by recursively traversing the list to reach the last node, which is the node whose next pointer is nullptr. Update last node's next pointer to point back to the head node to form a circular link.
Below is the implementation of the above approach:
C++
// C++ Program for converting singly linked list
// into circular linked list.
#include <bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node *next;
Node(int x) {
data = x;
next = nullptr;
}
};
// Function that convert singly linked list
// into circular linked list.
void circular(Node *curr, Node *head) {
// if last node, then point next ptr
// to head Node
if (curr->next == nullptr) {
curr->next = head;
return;
}
// otherwise traverse to the
// next node
circular(curr->next, head);
}
void printList(Node *head) {
Node *curr = head;
do {
cout << curr->data << " ";
curr = curr->next;
} while (curr != head);
cout << endl;
}
int main() {
// create a hard coded list
// 10->12->14->16
Node *head = new Node(10);
head->next = new Node(12);
head->next->next = new Node(14);
head->next->next->next = new Node(16);
circular(head, head);
printList(head);
return 0;
}
// C Program for converting singly linked list
// into circular linked list.
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
// Function that converts singly linked list into
// circular linked list
void circular(struct Node* curr, struct Node* head) {
// if last node, then point next ptr
// to head Node
if (curr->next == NULL) {
curr->next = head;
return;
}
// otherwise traverse to the
// next node
circular(curr->next, head);
}
void printList(struct Node* head) {
struct Node* curr = head;
do {
printf("%d ", curr->data);
curr = curr->next;
} while (curr != head);
printf("\n");
}
struct Node* createNode(int data) {
struct Node* newNode =
(struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
int main() {
// create a hard coded list 10->12->14->16
struct Node* head = createNode(10);
head->next = createNode(12);
head->next->next = createNode(14);
head->next->next->next = createNode(16);
circular(head, head);
printList(head);
return 0;
}
// Java Program for converting singly linked list
// into circular linked list.
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}
public class GfG {
// Function that converts singly linked
// list into circular linked list
static void circular(Node curr, Node head) {
// if last node, then point next ptr
// to head Node
if (curr.next == null) {
curr.next = head;
return;
}
// otherwise move to the
// next node
circular(curr.next, head);
}
static void printList(Node head) {
Node curr = head;
do {
System.out.print(curr.data + " ");
curr = curr.next;
} while (curr != head);
System.out.println();
}
public static void main(String[] args) {
// create a hard coded list 10->12->14->16
Node head = new Node(10);
head.next = new Node(12);
head.next.next = new Node(14);
head.next.next.next = new Node(16);
circular(head, head);
printList(head);
}
}
# Python program for converting singly linked list
# into circular linked list.
class Node:
def __init__(self, data):
self.data = data
self.next = None
# Function that converts singly linked list
# into circular linked list
def circular(curr, head):
# if last node, then point next ptr
# to head Node
if curr.next == None:
curr.next = head
return
# otherwise move to the
# next node
circular(curr.next, head)
def printList(head):
curr = head
while True:
print(curr.data, end=" ")
curr = curr.next
if curr == head:
break
print()
if __name__ == "__main__":
# create a hard coded list 10->12->14->16
head = Node(10)
head.next = Node(12)
head.next.next = Node(14)
head.next.next.next = Node(16)
circular(head, head)
printList(head)
// C# Program for converting singly linked list
// into circular linked list.
using System;
class Node {
public int data;
public Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function that converts singly linked list
// into circular linked list
static void Circular(Node curr, Node head) {
// if last node, then point next ptr
// to head Node
if (curr.next == null) {
curr.next = head;
return;
}
// otherwise move to the
// next node
Circular(curr.next, head);
}
static void PrintList(Node head) {
Node curr = head;
do {
Console.Write(curr.data + " ");
curr = curr.next;
} while (curr != head);
Console.WriteLine();
}
static void Main(string[] args) {
// create a hard coded list 10->12->14->16
Node head = new Node(10);
head.next = new Node(12);
head.next.next = new Node(14);
head.next.next.next = new Node(16);
Circular(head, head);
PrintList(head);
}
}
// Javascript program for converting singly linked list
// into circular linked list.
class Node {
constructor(data) {
this.data = data;
this.next = null;
}
}
// Function that converts singly linked
// list into circular linked list
function circular(curr, head) {
// if last node, then point next ptr
// to head Node
if (curr.next == null) {
curr.next = head;
return;
}
// otherwise move to the
// next node
circular(curr.next, head);
}
function printList(head) {
let curr = head;
do {
console.log(curr.data + " ");
curr = curr.next;
} while (curr !== head);
}
// create a hard coded list
// 10->12->14->16
let head = new Node(10);
head.next = new Node(12);
head.next.next = new Node(14);
head.next.next.next = new Node(16);
circular(head, head);
printList(head);
Time Complexity: O(n), where n is the number of nodes in the list.
Auxiliary Space: O(n)
[Expected Approach - 2] Using Iterative Approach - O(n) Time and O(1) Space:
To convert a singly linked list into a circular linked list iteratively, start by initializing a pointer to traverse the list from the head node. Traverse the list until we reach the node whose next pointer that is nullptr. Update its next pointer to point back to the head node.
Below is the implementation of the above approach:
C++
// C++ Program for converting singly linked list
// into circular linked list.
#include <bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node *next;
Node(int x) {
data = x;
next = nullptr;
}
};
// Function that convert singly linked list
// into circular linked list.
Node *circular(Node *head) {
// declare a node variable curr and
// assign head node into curr node.
Node *curr = head;
// check that while curr->next is not equal
// to NULL then curr points to next node.
while (curr->next != nullptr)
curr = curr->next;
// assign curr->next to the head node.
curr->next = head;
return head;
}
void printList(Node *head) {
Node *curr = head;
do {
cout << curr->data << " ";
curr = curr->next;
} while (curr != head);
cout << endl;
}
int main() {
// create a hard coded list
// 10->12->14->16
Node *head = new Node(10);
head->next = new Node(12);
head->next->next = new Node(14);
head->next->next->next = new Node(16);
head = circular(head);
printList(head);
return 0;
}
// C Program for converting singly linked list
// into circular linked list.
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
// Function that converts singly linked list into
// circular linked list
struct Node* circular(struct Node* head) {
// declare a node variable curr and
// assign head node into curr node.
struct Node* curr = head;
// check that while curr->next is not equal
// to NULL then curr points to next node.
while (curr->next != NULL)
curr = curr->next;
// assign curr->next to the head node.
curr->next = head;
return head;
}
void printList(struct Node* head) {
struct Node* curr = head;
do {
printf("%d ", curr->data);
curr = curr->next;
} while (curr != head);
printf("\n");
}
struct Node* createNode(int data) {
struct Node* newNode =
(struct Node*)malloc(sizeof(struct Node));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
int main() {
// create a hard coded list 10->12->14->16
struct Node* head = createNode(10);
head->next = createNode(12);
head->next->next = createNode(14);
head->next->next->next = createNode(16);
head = circular(head);
printList(head);
return 0;
}
// Java Program for converting singly linked list
// into circular linked list.
class Node {
int data;
Node next;
Node(int data) {
this.data = data;
this.next = null;
}
}
public class GfG {
// Function that converts singly linked
// list into circular linked list
static Node circular(Node head) {
// declare a node variable curr and
// assign head node into curr node.
Node curr = head;
// check that while curr->next is not equal
// to NULL then curr points to next node.
while (curr.next != null)
curr = curr.next;
// assign curr->next to the head node.
curr.next = head;
return head;
}
static void printList(Node head) {
Node curr = head;
do {
System.out.print(curr.data + " ");
curr = curr.next;
} while (curr != head);
System.out.println();
}
public static void main(String[] args) {
// create a hard coded list 10->12->14->16
Node head = new Node(10);
head.next = new Node(12);
head.next.next = new Node(14);
head.next.next.next = new Node(16);
head = circular(head);
printList(head);
}
}
# Python program for converting singly linked list
# into circular linked list.
class Node:
def __init__(self, data):
self.data = data
self.next = None
# Function that converts singly linked list
# into circular linked list
def circular(head):
# declare a node variable curr and
# assign head node into curr node.
curr = head
# check that while curr->next is not equal
# to NULL then curr points to next node.
while curr.next is not None:
curr = curr.next
# assign curr->next to the head node.
curr.next = head
return head
def printList(head):
curr = head
while True:
print(curr.data, end=" ")
curr = curr.next
if curr == head:
break
print()
if __name__ == "__main__":
# create a hard coded list 10->12->14->16
head = Node(10)
head.next = Node(12)
head.next.next = Node(14)
head.next.next.next = Node(16)
head = circular(head)
printList(head)
// C# Program for converting singly linked list
// into circular linked list.
using System;
class Node {
public int data;
public Node next;
public Node(int data) {
this.data = data;
this.next = null;
}
}
class GfG {
// Function that converts singly linked list
// into circular linked list
static Node Circular(Node head) {
// declare a node variable curr and
// assign head node into curr node.
Node curr = head;
// check that while curr->next is not equal
// to NULL then curr points to next node.
while (curr.next != null)
curr = curr.next;
// assign curr->next to the head node.
curr.next = head;
return head;
}
static void PrintList(Node head) {
Node curr = head;
do {
Console.Write(curr.data + " ");
curr = curr.next;
} while (curr != head);
Console.WriteLine();
}
static void Main(string[] args) {
// create a hard coded list 10->12->14->16
Node head = new Node(10);
head.next = new Node(12);
head.next.next = new Node(14);
head.next.next.next = new Node(16);
head = Circular(head);
PrintList(head);
}
}
// Javascript program for converting singly linked list
// into circular linked list.
class Node {
constructor(data) {
this.data = data;
this.next = null;
}
}
// Function that converts singly linked
// list into circular linked list
function circular(head) {
// declare a node variable curr and
// assign head node into curr node.
let curr = head;
// check that while curr->next is not equal
// to NULL then curr points to next node.
while (curr.next !== null) {
curr = curr.next;
}
// assign curr->next to the head node.
curr.next = head;
return head;
}
function printList(head) {
let curr = head;
do {
console.log(curr.data + " ");
curr = curr.next;
} while (curr !== head);
}
// create a hard coded list
// 10->12->14->16
let head = new Node(10);
head.next = new Node(12);
head.next.next = new Node(14);
head.next.next.next = new Node(16);
head = circular(head);
printList(head);
Time Complexity: O(n), where n is the number of nodes in the list.
Auxiliary Space: O(1)
Convert singly linked list into circular linked list
Similar Reads
Basics & Prerequisites
Data Structures
Getting Started with Array Data StructureArray is a collection of items of the same variable type that are stored at contiguous memory locations. It is one of the most popular and simple data structures used in programming. Basic terminologies of ArrayArray Index: In an array, elements are identified by their indexes. Array index starts fr
14 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