Traversal of Singly Linked List

   Last Updated: 06 October, 2024       🕓  5 Mins

In this Linked List tutorial, we will see all about the traversal of linked list.

To traverse a linked list, there are two approaches:

1. Iterative Approach
2. Recursive Approach

Traverse a linked list using Iterative approach

// Java program to traverse a linked list using Iterative approach public class TraversalUsingIterativeApproachInSLL { // Method to traverse and print the list static void traverseList(Node head) { while (head != null) { // Printing data of node System.out.print(head.data + " -> "); // Moving to the next node head = head.next; } System.out.println("null"); } public static void main(String[] args) { // Create a linked list Node head = new Node(10); head.next = new Node(20); head.next.next = new Node(30); head.next.next.next = new Node(40); head.next.next.next.next = new Node(50); // Linked list will be created like this // 10 -> 20 -> 30 -> 40 -> 50 // Traversing and printing the list traverseList(head); } }

Output

10 -> 20 -> 30 -> 40 -> 50 -> null

Traverse a linked list using Recursive approach

// Java program to traverse a linked list using Recursive approach public class TraversalUsingRecursiveApproachInSLL { // Method to traverse and print the linked list static void traverseList(Node head) { // Returns if list is empty if (head == null) { System.out.println("null"); return; } // Printing the node data System.out.print(head.data + " -> "); // Moving to the next node traverseList(head.next); } public static void main(String[] args) { // Create a linked list Node head = new Node(10); head.next = new Node(20); head.next.next = new Node(30); head.next.next.next = new Node(40); head.next.next.next.next = new Node(50); // Linked list will be created like this // 10 -> 20 -> 30 -> 40 -> 50 // Traversing and printing the list traverseList(head); } }

Output

10 -> 20 -> 30 -> 40 -> 50 -> null