Write a program to Reverse a singly Linked list

 #include <stdio.h>

#include <stdlib.h>

// Define the structure for a node in the linked list

struct Node {

    int data;

    struct Node* next;

};

// Function to create a new node with given data

struct Node* createNode(int data) {

    struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));

    newNode->data = data;

    newNode->next = NULL;

    return newNode;

}

// Function to insert a node at the end of the linked list

void insertAtEnd(struct Node** head, int data) {

    struct Node* newNode = createNode(data);

    if (*head == NULL) {

        *head = newNode;

        return;

    }

    struct Node* temp = *head;

    while (temp->next != NULL) {

        temp = temp->next;

    }

    temp->next = newNode;

}

// Function to print the linked list

void printList(struct Node* node) {

    while (node != NULL) {

        printf("%d -> ", node->data);

        node = node->next;

    }

    printf("NULL\n");

}

// Function to reverse the linked list

void reverseList(struct Node** head) {

    struct Node* prev = NULL;

    struct Node* current = *head;

    struct Node* next = NULL;

    while (current != NULL) {

        next = current->next; // Store next

        current->next = prev; // Reverse current node's pointer

        prev = current; // Move pointers one position ahead

        current = next;

    }

    *head = prev;

}

int main() {

    struct Node* head = NULL;

    // Inserting nodes into the linked list

    insertAtEnd(&head, 1);

    insertAtEnd(&head, 2);

    insertAtEnd(&head, 3);

    insertAtEnd(&head, 4);

    insertAtEnd(&head, 5);

    printf("Original list: ");

    printList(head);

    // Reversing the linked list

    reverseList(&head);

    printf("Reversed list: ");

    printList(head);

    return 0;

}