Microsoft interview question
Recursively reverse a singly linked list.
Interview Answers
Anonymous
19 Nov 2009
Just gave this a shot. void reverse(Node node, Node previous){ Node next = node->next; node->next = previous; //point to previous node if(next != null) { reverse(next, node); } }