Recursive insertion and traversal linked list
Last Updated :
29 Aug, 2024
The task is to implement a singly linked list with two core functionalities using recursion:
Insertion: Insert a new node at the end of the linked list.
Traversal: Traverse the linked list and print the data stored in each node.
Example :
Input: Values to be inserted = 1, 2, 3, 4, 5
Output: 1 -> 2 -> 3 -> 4-> 5 -> NULL
Explanation : We have to first recursively insert each node with the given input value and then print the linked list recursively
Input: Values to be inserted = 7, 8, 4, 11, 44, 6
Output: 7 -> 8 -> 4 -> 11 -> 44 -> 6 -> NULL
Approach :
Define a Node class/struct with data and a reference to the next node. Implement a recursive function to insert a new node at the end of the list. Finally, use a recursive traversal function to print the data of each node in the list.
Follow the steps below to solve the problem:
1. Insert a Node: Write a function that adds a new node to the end of the list. If the list is empty, this new node becomes the first node. If the list already has nodes, the function will keep moving to the next node until it finds the last one, then adds the new node there.
2. Traverse the List: Write a function to go through each node in the list, starting from the first one. While traversing each node, it will print out the data stored in that node. This function will keep moving to the next node until it reaches the end of the list.
Below is the implementation of the above approach:
C++
// C++ program to implement Recursive insertion and
// traversal in a linked list
#include <bits/stdc++.h>
using namespace std;
class Node {
public:
int data;
Node* next;
Node(int new_data) {
data = new_data;
next = nullptr;
}
};
// Function to insert a new node at the
// end of linked list using recursion.
Node* insertEnd(Node* head, int data) {
// If linked list is empty, create a new node
if (head == nullptr)
return new Node(data);
// If we have not reached the end,
// keep traversing recursively
head->next = insertEnd(head->next, data);
return head;
}
// Function to traverse and print the linked list
// starting from the head node, recursively
void traverse(Node* head) {
if (head == nullptr)
return;
cout << head->data << " ";
// Recur for the remaining list
traverse(head->next);
}
int main() {
// Insert nodes with data 1, 2, 3, 4, 5
Node* head = nullptr;
head = insertEnd(head, 1);
head = insertEnd(head, 2);
head = insertEnd(head, 3);
head = insertEnd(head, 4);
head = insertEnd(head, 5);
traverse(head);
}
// C program to implement Recursive insertion and
// traversal in a linked list
#include <stdio.h>
#include <stdlib.h>
struct Node {
int data;
struct Node* next;
};
struct Node* newNode(int new_data);
// Function to insert a new node at the
// end of linked list using recursion.
struct Node* insertEnd(struct Node* head, int data) {
// If linked list is empty, create a new node
if (head == NULL)
return newNode(data);
// If we have not reached the end,
// keep traversing recursively
head->next = insertEnd(head->next, data);
return head;
}
// Function to traverse and print the linked list
// starting from the head node, recursively
void traverse(struct Node* head) {
if (head == NULL) return;
printf("%d ", head->data);
// Recur for the remaining list
traverse(head->next);
}
struct Node* newNode(int new_data) {
struct Node* new_node =
(struct Node*)malloc(sizeof(struct Node));
new_node->data = new_data;
new_node->next = NULL;
return new_node;
}
int main() {
// Insert nodes with data 1, 2, 3, 4, 5
struct Node* head = NULL;
head = insertEnd(head, 1);
head = insertEnd(head, 2);
head = insertEnd(head, 3);
head = insertEnd(head, 4);
head = insertEnd(head, 5);
traverse(head);
return 0;
}
// Java program to implement Recursive insertion and
// traversal in a linked list
class Node {
int data;
Node next;
Node(int new_data) {
data = new_data;
next = null;
}
}
public class GfG {
// Function to insert a new node at the
// end of linked list using recursion.
static Node insertEnd(Node head, int data) {
// If linked list is empty, create a new node
if (head == null)
return new Node(data);
// If we have not reached the end
// keep traversing recursively
head.next = insertEnd(head.next, data);
return head;
}
// Function to traverse and print the linked list
// starting from the head node, recursively
static void traverse(Node head) {
if (head == null) return;
System.out.print(head.data + " ");
// Recur for the remaining list
traverse(head.next);
}
public static void main(String[] args) {
// Insert nodes with data 1, 2, 3, 4, 5
Node head = null;
head = insertEnd(head, 1);
head = insertEnd(head, 2);
head = insertEnd(head, 3);
head = insertEnd(head, 4);
head = insertEnd(head, 5);
traverse(head);
}
}
# Python program to implement Recursive insertion and
# traversal in a linked list
class Node:
def __init__(self, new_data):
self.data = new_data
self.next = None
# Function to insert a new node at the
# end of linked list using recursion.
def insert_end(head, data):
# If linked list is empty, create a new node
if head is None:
return Node(data)
# If we have not reached the end,
# keep traversing recursively
head.next = insert_end(head.next, data)
return head
# Function to traverse and print the linked list
# starting from the head node, recursively
def traverse(head):
if head is None:
return
print(head.data, end=" ")
# Recur for the remaining list
traverse(head.next)
if __name__ == "__main__":
# Insert nodes with data 1, 2, 3, 4, 5
head = None
head = insert_end(head, 1)
head = insert_end(head, 2)
head = insert_end(head, 3)
head = insert_end(head, 4)
head = insert_end(head, 5)
traverse(head)
// C# program to implement Recursive insertion and
// traversal in a linked list
using System;
class Node {
public int data;
public Node next;
public Node(int new_data) {
data = new_data;
next = null;
}
}
class GfG {
// Function to insert a new node at the
// end of linked list using recursion.
static Node InsertEnd(Node head, int data) {
// If linked list is empty, create a new node
if (head == null)
return new Node(data);
// If we have not reached the end,
// keep traversing recursively
head.next = InsertEnd(head.next, data);
return head;
}
// Function to traverse and print the linked list
// starting from the head node, recursively
static void Traverse(Node head) {
if (head == null)
return;
Console.Write(head.data + " ");
// Recur for the remaining list
Traverse(head.next);
}
static void Main(string[] args) {
// Insert nodes with data 1, 2, 3, 4, 5
Node head = null;
head = InsertEnd(head, 1);
head = InsertEnd(head, 2);
head = InsertEnd(head, 3);
head = InsertEnd(head, 4);
head = InsertEnd(head, 5);
Traverse(head);
}
}
// Javascript program to implement Recursive insertion and
// traversal in a linked list
class Node {
constructor(new_data) {
this.data = new_data;
this.next = null;
}
}
// Function to insert a new node at the
// end of linked list using recursion.
function insertEnd(head, data) {
// If linked list is empty, create a new node
if (head === null)
return new Node(data);
// If we have not reached the end,
// keep traversing recursively
head.next = insertEnd(head.next, data);
return head;
}
// Function to traverse and print the linked list
// starting from the head node, recursively
function traverse(head) {
if (head === null)
return;
console.log(head.data + " ");
// Recur for the remaining list
traverse(head.next);
}
// Insert nodes with data 1, 2, 3, 4, 5
let head = null;
head = insertEnd(head, 1);
head = insertEnd(head, 2);
head = insertEnd(head, 3);
head = insertEnd(head, 4);
head = insertEnd(head, 5);
traverse(head);
Time Complexity: O(n), to traverse the linked list of size n
Auxiliary Space: O(n), for recursion call stack
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