here it is (untested, let me know if i am wrong) Node* Reverse(Node* Head) { Node* p = Head; Node* temp = null; Node* pr = null; while(temp) { temp = p->next; p->next = pr; pr = p; p = temp; } return pr; }