Reverse a linked list

ReverseLinkedList.cpp

/* https://www.hackerrank.com/challenges/reverse-a-linked-list
  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)
{
  // Complete this method
    Node *next;
    Node *current = head;
    Node *previous = NULL;
    while(current != NULL) {
        next = current->next;
        current->next = previous;
        previous = current;
        current = next;
    }
    return previous;
}