#include typedef struct node { long value; struct node *next; } node; node *head; void push(long value) { node *n = malloc(sizeof *n); n->value = value; n->next = head; head = n; } void reverse(void) { node *prev = NULL; node *cur = head; while (cur) { node *next = cur->next; cur->next = prev; prev = cur; cur = next; } head = prev; } void clear(void) { while (head) { node *n = head; head = n->next; free(n); } } int main(void) { push(7); push(12); push(9); reverse(); clear(); return 0; }