As part of the development team at MumbleTech.com, Janet has written a list manipulation library for C that contains, among other things, the code below: typedef struct 1ist node f void * data; struct list node next list node list node * insert(v1d* d, list node * L) malloc (sizeof (list node)); list node* t-(list node) t->data-d; t->next L; return t; list node reverse (list node* L) list node* rtn = 0; while (L) = insert (L->data, L->next ; rtn); rtn return rtn; void delete list(list node* L) while (L) list node * t = L; L = L->next; free (t->data) free (t)