reverse_linked_list.c

linked lists Implementation

69 lines
1341 bytes
C
1// Reverse a Linked List
2#include <stdio.h>
3#include <stdlib.h>
4
5struct Node {
6    int data;
7    struct Node* next;
8};
9
10// Insert at end
11struct Node* insertAtEnd(struct Node* head, int data) {
12    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
13    newNode->data = data;
14    newNode->next = NULL;
15    
16    if (head == NULL) return newNode;
17    
18    struct Node* temp = head;
19    while (temp->next != NULL) {
20        temp = temp->next;
21    }
22    temp->next = newNode;
23    return head;
24}
25
26// Reverse linked list
27struct Node* reverse(struct Node* head) {
28    struct Node* prev = NULL;
29    struct Node* current = head;
30    struct Node* next = NULL;
31    
32    while (current != NULL) {
33        next = current->next;
34        current->next = prev;
35        prev = current;
36        current = next;
37    }
38    
39    return prev;
40}
41
42// Display
43void display(struct Node* head) {
44    while (head != NULL) {
45        printf("%d -> ", head->data);
46        head = head->next;
47    }
48    printf("NULL\n");
49}
50
51int main() {
52    struct Node* head = NULL;
53    
54    head = insertAtEnd(head, 10);
55    head = insertAtEnd(head, 20);
56    head = insertAtEnd(head, 30);
57    head = insertAtEnd(head, 40);
58    
59    printf("Original: ");
60    display(head);
61    
62    head = reverse(head);
63    
64    printf("Reversed: ");
65    display(head);
66    
67    return 0;
68}
69