Reverse doubly linked list in c++

void DoublyLinkedList::reverse() { if(!head || !head->next) return; node* temp{nullptr}; node* p1{head}; while(p1 != nullptr){ temp = p1->previous; p1->previous = p1->next; p1->next = temp; p1 = p1->previous; } if (temp != nullptr) { head = temp->previous; } }