Microsoft interview question
reverse a linkedlist
Interview Answer
Anonymous
1 Feb 2017
//return new head Node* reverse(Node* head) { Node* t; Node* prev = NULL; while (head != NULL){ t = head->next; head->next = prev; prev = head; head = t; }; return prev;