algorithms_list_reversal.c

typedef struct _node{
  struct _node* next;
  int data;
} NODE;

NODE *list_reverse_LONG_VERSION(NODE *head) {
    // create local (temp) nodes to cache node pointers 
    NODE *prev   = NULL;
    NODE *current = head;
    NODE *next;

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