Untitled

void rev(LinkedListNode<int>* &head,LinkedListNode<int>* curr,LinkedListNode<int>* prev){
    if(curr==NULL) {
        head=prev;
        return ;
    }
    LinkedListNode<int>* forward=curr->next;
    rev(head,forward,curr);
    curr->next=prev;
    

}

LinkedListNode<int> *reverseLinkedList(LinkedListNode<int> *head) 
{
    LinkedListNode<int>* curr=head;
    LinkedListNode<int>* prev=NULL;
    rev(head,curr,prev);
    return head;
    }