node* p = pHead; // so P is now pointing to the head of the linked list. node* r = p; // r will point in reverse order while ( p != NULL ) { r = p = p->next; } basically r ends up pointing to the end of list, i.e reverse order.