Given a Singly Linked List, the task is to print all the elements in the list.
Examples:
Input: 1->2->3->4->5->null
Output: 1 2 3 4 5
Explanation: Every element of each node from head node to last node is printed.
Input: 10->20->30->40->50->null
Output: 10 20 30 40 50
Explanation: Every element of each node from head node to last node is printed.
Iterative Approach - O(n) Time and O(1) Space
The process of printing a singly linked list involves printing the value of each node and then going on to the next node and print that node's value also and so on, till we reach the last node in the singly linked list, whose next node points towards the null.
Step-by-Step Algorithm
- We will initialize a temporary pointer to the head node of the singly linked list.
- After that, we will check if that pointer is null or not null, if it is null, then return.
- While the pointer is not null, we will access and print the data of the current node, then we move the pointer to next node.
Program to Print the Singly Linked List using Iteration.
C++
//Driver Code Starts
#include <iostream>
using namespace std;
//Driver Code Ends
// A linked list node
class Node {
public:
int data;
Node* next;
// Constructor to initialize a new node with data
Node(int new_data) {
this->data = new_data;
this->next = nullptr;
}
};
// Function to print the singly linked list
void printList(Node* head) {
// A loop that runs till head is nullptr
while (head != nullptr) {
// Printing data of current node
cout << head->data << " ";
// Moving to the next node
head = head->next;
}
}
//Driver Code Starts
int main() {
// Create a linked list: 10 -> 20 -> 30 -> 40
Node* head = new Node(10);
head->next = new Node(20);
head->next->next = new Node(30);
head->next->next->next = new Node(40);
printList(head);
return 0;
}
//Driver Code Ends
//Driver Code Starts
#include <stdio.h>
#include <stdlib.h>
//Driver Code Ends
// A linked list node
struct Node {
int data;
struct Node* next;
};
// Function to create a new node
struct Node* createNode(int new_data) {
struct Node* node = (struct Node*)malloc(sizeof(struct Node));
node->data = new_data;
node->next = NULL;
return node;
}
// Function to print the singly linked list
void printList(struct Node* head) {
// A loop that runs till head is NULL
while (head != NULL) {
// Printing data of current node
printf("%d ", head->data);
// Moving to the next node
head = head->next;
}
}
//Driver Code Starts
int main() {
// Create a linked list: 10 -> 20 -> 30 -> 40
struct Node* head = createNode(10);
head->next = createNode(20);
head->next->next = createNode(30);
head->next->next->next = createNode(40);
printList(head);
return 0;
}
//Driver Code Ends
class Node {
int data;
Node next;
// Constructor to initialize a new node with data
Node(int newData) {
this.data = newData;
this.next = null;
}
}
class GfG {
// Function to print the singly linked list
static void printList(Node head) {
// A loop that runs till head is null
while (head != null) {
// Printing data of current node
System.out.print(head.data + " ");
// Moving to the next node
head = head.next;
}
}
//Driver Code Starts
public static void main(String[] args) {
// Create a linked list: 10 -> 20 -> 30 -> 40
Node head = new Node(10);
head.next = new Node(20);
head.next.next = new Node(30);
head.next.next.next = new Node(40);
printList(head);
}
}
//Driver Code Ends
# A linked list node
class Node:
def __init__(self, newData):
# Constructor to initialize a new node with data
self.data = newData
self.next = None
# Function to print the singly linked list
def printList(head):
# A loop that runs till head is None
while head is not None:
# Printing data of current node
print(head.data, end=" ")
# Moving to the next node
head = head.next
if __name__ == "__main__":
#Driver Code Starts
# Create a linked list: 10 -> 20 -> 30 -> 40
head = Node(10)
head.next = Node(20)
head.next.next = Node(30)
head.next.next.next = Node(40)
printList(head)
#Driver Code Ends
//Driver Code Starts
using System;
//Driver Code Ends
class Node {
public int data;
public Node next;
// Constructor to initialize a new node with data
public Node(int new_data) {
this.data = new_data;
this.next = null;
}
}
class GfG {
// Function to print the singly linked list
static void printList(Node head) {
// A loop that runs till head is null
while (head != null) {
// Printing data of current node
Console.Write(head.data + " ");
// Moving to the next node
head = head.next;
}
}
//Driver Code Starts
static void Main(string[] args) {
// Create a linked list: 10 -> 20 -> 30 -> 40
Node head = new Node(10);
head.next = new Node(20);
head.next.next = new Node(30);
head.next.next.next = new Node(40);
printList(head);
}
}
//Driver Code Ends
class Node {
constructor(newData) {
// Constructor to initialize a new node with data
this.data = newData;
this.next = null;
}
}
// Function to print the singly linked list
function printList(head) {
let result = '';
// A loop that runs till head is null
while (head !== null) {
// Printing data of current node
result += head.data + ' ';
// Moving to the next node
head = head.next;
}
console.log(result.trim());
}
//Driver Code Starts
// Driver Code
// Create a linked list: 10 -> 20 -> 30 -> 40
const head = new Node(10);
head.next = new Node(20);
head.next.next = new Node(30);
head.next.next.next = new Node(40);
printList(head);
//Driver Code Ends
Time Complexity: O(n), where n is the number of nodes in the linked list.
Auxiliary Space: O(1)
Recursive Approach - O(n) Time and O(n) Memory Space
We can also traverse the singly linked list using recursion. We start at the head node of the singly linked list, check if it is null or not and print its value. We then call the traversal function again with the next node passed as pointer.
Step-by-Step Algorithm
- Firstly, we define a recursive method to traverse the singly linked list, which takes a node as a parameter.
- In this function, the base case is that if the node is null then we will return from the recursive method.
- We then pass the head node as the parameter to this function.
- After that, we access and print the data of the current node.
- At last, we will make a recursive call to this function with the next node as the parameter.
Program to Print the Singly Linked List using Recursion.
C++
#include <iostream>
using namespace std;
// A linked list node
class Node {
public:
int data;
Node* next;
// Constructor to initialize a new node with data
Node(int new_data) {
this->data = new_data;
this->next = nullptr;
}
};
// Function to print the singly linked list
void printList(Node* head) {
// Base condition is when the head is nullptr
if (head == nullptr) {
return;
}
// Printing the current node data
cout << head->data << " ";
// Moving to the next node
printList(head->next);
}
int main() {
// Create a linked list: 10 -> 20 -> 30 -> 40
Node* head = new Node(10);
head->next = new Node(20);
head->next->next = new Node(30);
head->next->next->next = new Node(40);
printList(head);
return 0;
}
#include <stdio.h>
#include <stdlib.h>
// A linked list node
struct Node {
int data;
struct Node* next;
};
// Function to create a new node with given data
struct Node* createNode(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;
}
// Function to print the singly linked list
void printList(struct Node* head) {
// Base condition is when the head is nullptr
if (head == NULL) {
return;
}
// Printing the current node data
printf("%d ", head->data);
// Moving to the next node
printList(head->next);
}
int main() {
// Create a linked list: 10 -> 20 -> 30 -> 40
struct Node* head = createNode(10);
head->next = createNode(20);
head->next->next = createNode(30);
head->next->next->next = createNode(40);
printList(head);
return 0;
}
// A linked list node
class Node {
int data;
Node next;
// Constructor to initialize a new node with data
Node(int new_data) {
data = new_data;
next = null;
}
}
class GfG {
// Function to print the singly linked list
static void printList(Node head) {
// Base condition is when the head is nullptr
if (head == null) {
return;
}
// Printing the current node data
System.out.print(head.data + " ");
// Moving to the next node
printList(head.next);
}
public static void main(String[] args) {
// Create a linked list: 10 -> 20 -> 30 -> 40
Node head = new Node(10);
head.next = new Node(20);
head.next.next = new Node(30);
head.next.next.next = new Node(40);
printList(head);
}
}
# A linked list node
class Node:
def __init__(self, data):
# Constructor to initialize a new node with data
self.data = data
self.next = None
# Function to print the singly linked list
def printList(head):
# Base condition is when the head is nullptr
if head is None:
return
# Printing the current node data
print(head.data, end=" ")
# Moving to the next node
printList(head.next)
if __name__ == "__main__":
# Create a linked list: 10 -> 20 -> 30 -> 40
head = Node(10)
head.next = Node(20)
head.next.next = Node(30)
head.next.next.next = Node(40)
printList(head)
using System;
// A linked list node
class Node {
public int Data { get;set; }
public Node Next { get;set; }
// Constructor to initialize a new node with data
public Node(int newData) {
Data = newData;
Next = null;
}
}
class GfG {
// Function to print the singly linked list
static void printList(Node head) {
// Base condition is when the head is nullptr
if (head == null) {
return;
}
// Printing the current node data
Console.Write(head.Data + " ");
// Moving to the next node
printList(head.Next);
}
static void Main() {
// Create a linked list: 10 -> 20 -> 30 -> 40
Node head = new Node(10);
head.Next = new Node(20);
head.Next.Next = new Node(30);
head.Next.Next.Next = new Node(40);
printList(head);
}
}
Time Complexity: O(n), where n is number of nodes in the linked list.
Space complexity: O(n) because of recursive stack space.
Similar Reads
DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read
Array Data Structure Guide In 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
4 min read
Sorting Algorithms A 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