HackerRank - reverse a doubly linked list

reverseDoublyLinkedList.cpp

/*
   Reverse a doubly linked list, input list may also be empty
   Node is defined as
   struct Node
   {
     int data;
     Node *next;
     Node *prev;
   }
*/
Node* Reverse(Node* head)
{
    if(head==NULL)
        return NULL; 
    if(head->next ==NULL)
        return head;        
    
    Node* newHead = Reverse(head->next); 
    
    head->next->next = head; 
    head->prev =head->next; 
    head->next = NULL;
    
    return newHead; 
}