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);
}
}
Anoniem
1 okt 2011
My fav :)
Anoniem
25 mei 2019
Stand up and walk backwards out of the interview room.
Anoniem
21 mrt 2009
The difficulty was not so much in the question but in the on the spot nature without much time.