How about pushing them in stack as you traverse forward, and link them in reverse as you pop them out.

revereseList ( struct node * head) { struct node *next, *current, *prev; if (head == null) return null; current = head; prev = null; while (current != null) { next = current->next; current->next = prev; prev = current; current = next; } head = prev; }