reverse_ll.cpp

/*
  Reverse a linked list and return pointer to the head
  The input list will have at least one element  
  Node is defined as 
  struct Node
  {
     int data;
     struct Node *next;
  }
*/
Node* Reverse(Node *head)
{
    
    Node* daeh;
    daeh = (Node*)malloc(sizeof(Node)); 
    daeh->next = NULL;
    
    Node* head_trv = head;
    
    while(head_trv)
    {
        Node* new_elem;
        new_elem = (Node*)malloc(sizeof(Node)); 
        new_elem->data = head_trv->data;
        new_elem->next = daeh;
        daeh = new_elem;
        head_trv = head_trv->next;
    }
    
    Node* tail = daeh;
    while(tail)
    {
        tail = tail->next;
    }
    
    
    return daeh;
}