How to Reverse a Singly linked list ? C/C++ Program

To reverse a given linked list ,we have to point the next (link) of each node to its previous node(ie: the node which is pointing to it.)
for that we will maintain three pointers :
1) prev : will point to the node which is pointing to the current node.
2) cur : will point to the node in which we have to change the next(link) to the previous node.
3) next: in the process of changing the cur->next to prev the           cur->next will be lost so to store the address of cur->next we use next pointer.

Node definition:

typedef struct node{
     int val;
     struct node* next;
 }* node;

as given above the node contains two members value and a pointer pointing to its own datatype which will store the address of another node .

reverse_ll(node *first) : function :

void reverse_ll(node* first){
     node prev=NULL;
     node cur=(*first);
     node next=NULL;
     while(cur){
         next=cur->next;
         cur->next=prev;
         prev=cur;
         cur=next;
 } *first=prev;
 }

for reversing a linked list the above function is called by passing the first node of the linked list.
the function maintains three node pointers previous,current,next.
1) the next pointer stores the address of the cur->next node so that we can change cur->next value.
2) then the cur->next is pointed to its previous node.
3) and finally the previous becomes current node and the current becomes next and this same is repeated until current points to NULL .

OUTPUT:

SOURCE CODE:

//  https://www.qxcoding.com/ 
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
     int val;
     struct node* next;
 }* node;
 node create(int val){
     node temp;
     if(!(temp=(node)malloc(sizeof(struct node)))){
         printf("not enough memory available\n");
         exit(0);
     }
     temp->val=val;
     temp->next=NULL;
     return temp;
 }
 void push(node* first,int val){
     node nt=create(val);
     if(!(*first)){
         //printf("empty linked list\n");
         *first=nt;
     }
     else{
         nt->next=*first;
         *first=nt;
     }
 }
 node create_ll(){
     int s,num;
     node first=NULL;
     printf("Enter elements to be inserted \n");
     scanf("%d",&s);
     printf("Enter values\n");
     for(int i=0;ival);
             first=first->next;
         }
     printf("\n");
 }
 void delete_ll(node first){
     if(first==NULL)
         return;
     delete_ll(first->next);
     free(first);
 }
 void reverse_ll(node* first){
     node prev=NULL;
     node cur=(*first);
     node next=NULL;
     while(cur){
         next=cur->next;
         cur->next=prev;
         prev=cur;
         cur=next;
 } *first=prev;
 }
 int main(){
     node first=create_ll();
     printf("The origlinal linked list is: \n");
     display_ll(first);
     printf("Reversed linked list is\n");
     reverse_ll(&first);
     display_ll(first);
     delete_ll(first);
     first=NULL;
     printf("Memory deallocated succesfully\n\n");
     return 0;
 }

if any doubts or queries please comment