Print Reversed linked list

SWIFT – Print elements of Linked List in Reverse Order

(Last Updated On: September 25, 2021)

Hey Folks! Today we will be doing a challenge to print out the elements of a linked list in reverse order in Swift

First of all, If you do not have a Linked List created in your playground, go to my Linked List In Swift blog post and copy the code.

Now let’s dive directly into the code.

First, we will create a linked list and append some data to it.

import Foundation

var list = LinkedList<Int>()

func addDataToList() {


Approach 1

Now once we have added the data, let’s start writing our reverse function. Start writing down the code below the addDataToList()function call.

// create a function that prints out the element of a linked list in reverse order

func reverseList<T>( _ list : LinkedList<T>) -> String {

    guard let _ = list.head else {
        return "Empty List"
    var current = list.head
    var reverseString = ""
    repeat {
        reverseString =  "\(current!.value) " + reverseString
        current = current?.next
    } while (current != nil)
    return reverseString
print("BEFORE: ",list)
print("AFTER: ", reverseList(list))

Here is what we have done in the above code.

  1. We start the code by creating a generic function named reverseList that takes a linked list as a parameter and returns a string.
  2. With help of a guard statement, we check if the head node of the list is not empty. If it is nil, then the else block will be executed and will return Empty List.
  3. Once we have checked that the list is not empty, we declare two variables named current and reverseString. reverseString will hold the final reverse string and current will be used to traverse the list by incrementing its position after every loop.
  4. We are using a repeat-while loop which is swift equivalent to do while loop. In the repeat while loop, we are traversing through all the elements of the linked list. We add the current value to the beginning of the reverse string and then change the position of current to current?.next. We can also force unwrap the value of current in repeat-while loop as we know current will never be nil inside the block. The while loop will keep running until current is not equal to nil.

It’s time now to run the code and check if it’s working. Write a print statement to check if the function is working. Run the playground and you will see this output in the console.

BEFORE:  5 --> 6 --> 1 --> 3 --> 4 --> 6     
AFTER:  6 4 3 1 6 5 

Approach 2

In this approach, we will reverse the linked list and print it. If you are preparing for interviews, this approach would interest the interviewer more. Lets write down the code.

The trick to reverse a linked list is to just point next position of the node to previous. Example: 5->6->7->8->9->nil now instead of changing the position of the node., we will just change the arrows to point to previous nodes i.e. 5<-6<-7<-8<-9 and change the head to 9.

func reverse<T>(llist: Node<T>?) -> Node<T>? {
    //1 Write your code here
    // check for nil
    if llist == nil {
        return nil
    //2 check if only element
    if llist?.next == nil {
        return llist
    //3  check for multiple elements
    var head = llist
    var prev : Node<T>? = nil
    var current = llist
    var next = llist?.next
    while next != nil {
        current?.next = prev
        prev = current
        current = next
        next = current?.next
    current?.next = prev
    head = current
    return head
print("REVERSE: ", reverse(llist: list.head) as Any)

So let’s understand how the code above works.

  1. First we will check if the given linked list is not equal to list. If it equals to nil, return nil from the function.
  2. Next we check if the list only contains one node. If true, return the same as reverse of one node will be the same node itself.
  3. Now we check for multiple elements. Here we are declaring some variables to store the current, previous, next and head position. We have set the initial value of prev = nil as there is nothing previous to head.
  4. Now we will start a while loop till next is not equal to nil and keep increasing the position of next to its next node. We will swap values of current previous and next as shown in the code.
  5. The while loop only run till next != nil . That means the tail node which is currently assigned to current node is still not traveresed. We will assign the tail(current?.next = prev) index of its previous node and make the tail as head.
  6. Finally print the list.

LIST:  1 --> 2 --> 3 --> 4 --> 5 --> 6 --> 7      
REVERSE: 7 --> 6 --> 5 --> 4 --> 3 --> 2 --> 1  

Both the approaches above work perfectly. If you have any other issues, please reach out in the comments.

Leave a Comment