Reverse a doubly linked list

Node* reverseDLL(Node * head)
{
    //Your code here
    Node* cur=head;
    if(cur==NULL and cur->next==NULL)
       return head;
    
    while(cur->next!=NULL)
       cur=cur->next;
    
    head=cur;
    cur->next=cur->prev;
    cur->prev=NULL;
    cur=cur->next;
    while(cur->prev!=NULL)
    {
        Node* temp=cur->next;
        cur->next=cur->prev;
        cur->prev=temp;
        cur=cur->next;
    }
    cur->prev=cur->next;
    cur->next=NULL;
    return head;
}