Reverse Linked List

#include <bits/stdc++.h>

/****************************************************************

    Following is the class structure of the LinkedListNode class:

    template <typename T>
    class LinkedListNode
    {
    public:
        T data;
        LinkedListNode<T> *next;
        LinkedListNode(T data)
        {
            this->data = data;
            this->next = NULL;
        }
    };

*****************************************************************/

LinkedListNode<int> *reverseLinkedList(LinkedListNode<int> *head) 
{
    LinkedListNode<int> *prev = nullptr;
    LinkedListNode<int> *curr = head;
    LinkedListNode<int> *next = nullptr;

    while (curr != nullptr)
    {
        next = curr->next; // Store the next node
        curr->next = prev; // Reverse the link
        prev = curr;       // Move prev to current node
        curr = next;       // Move current node to next node
    }

    return prev; // Return the new head of the reversed linked list
}