Interview Question for Software Engineer at IBM:

Node*
Reverse(Node *head)
{
  Node *prev = NULL, *next = NULL;

  while (NULL != head) {
    next = head->next;
    head->next = prev;
    prev = head;
    head = next;
    if (NULL != next) {
       next = next->next;
    }
  }

  return prev;
}