C Program to Reverse a Linked List without Recursion

This C program, using iteration, displays a linked list in reverse. A linked list is an ordered set of data elements, each containing a link to its successor.

Here is the source code of the C program to display a linked list in reverse. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C Program to Display the Nodes of a Linked List in Reverse without

```
 * using Recursion
```
```
 */
```
```
 
```
```
#include <stdio.h>
```
```
#include <stdlib.h>
```
```
 
```
```
struct node
```
```
{
```
```
    int visited;
```
```
    int a;
```
```
    struct node *next;
```
```
};
```
```
 
```
```
void generate(struct node **);
```
```
void display(struct node *);
```
```
void linear(struct node *);
```
```
void delete(struct node **);
```
```
 
```
```
int main()
```
```
{
```
```
    struct node *head = NULL;
```
```
 
```
```
    generate(&head);
```

    printf("\nPrinting the list in linear order\n");

```
    linear(head);
```

    printf("\nPrinting the list in reverse order\n");

```
    display(head);
```
```
    delete(&head);
```
```
 
```
```
    return 0;
```
```
}
```
```
 
```
```
void display(struct node *head)
```
```
{
```

    struct node *temp = head, *prev = head;

```
 
```
```
    while (temp->visited == 0)
```
```
    {
```

        while (temp->next != NULL && temp->next->visited == 0)

```
        {
```
```
            temp = temp->next;
```
```
        }
```
```
        printf("%d  ", temp->a);
```
```
        temp->visited = 1;
```
```
        temp = head;
```
```
    }    
```
```
}
```
```
 
```
```
void linear(struct node *head)
```
```
{
```
```
    while (head != NULL)
```
```
    {
```
```
        printf("%d  ", head->a);
```
```
        head = head->next;
```
```
    }
```
```
    printf("\n");
```
```
}
```
```
 
```
```
void generate(struct node **head)
```
```
{
```
```
    int num, i;
```
```
    struct node *temp;
```
```
 
```
```
    printf("Enter length of list: ");
```
```
    scanf("%d", &num);
```
```
    for (i = num; i > 0; i--)
```
```
    {
```

        temp = (struct node *)malloc(sizeof(struct node));

```
        temp->a = i;
```
```
        temp->visited = 0;
```
```
        if (*head == NULL)
```
```
        {
```
```
            *head = temp;
```
```
            (*head)->next = NULL;
```
```
        }
```
```
        else
```
```
        {
```
```
            temp->next = *head;
```
```
            *head = temp;
```
```
        }
```
```
    }
```
```
}
```
```
 
```
```
void delete(struct node **head)
```
```
{
```
```
    struct node *temp;
```
```
    while (*head != NULL)
```
```
    {
```
```
        temp = *head;
```
```
        *head = (*head)->next;
```
```
        free(temp);
```
```
    }
```
```
}
```

$ gcc revnode_iter.c -o revnode_iter
$ a.out
Enter length of list: 5
 
Printing the list in linear order
1  2  3  4  5  
 
Printing the list in reverse order
5  4  3  2  1

Sanfoundry Global Education & Learning Series – 1000 C Programs.

Note: Join free Sanfoundry classes at Telegram or Youtube

Here’s the list of Best Books in C Programming, Data-Structures and Algorithms

If you wish to look at other example programs on Linked List, go to Linked List. If you wish to look at programming examples on all topics, go to C Programming Examples.

« Prev - C Program to Count the Occurrences of Elements in a Linked List using Recursion

» Next - C Program to Print All Nodes of Linked List using Recursion

Next Steps: