struct Node{
   Value data;
   Node* next;              
}

Node* ReverseSingleLinkedList(Node* head){
   //inital status
   Node* p = head;
   Node* q = head;   
   head = NULL;  // initialize new head as NULL

   while(p != NULL){
      
      q = p->next;  //save p‘s next
      p->next = head;    
      head = p;// set new head
      p=q;  //to proceed
   };   

   return head;
}

再說單鏈表反轉