Hello all, I'm working on a Double Linked List in C and I've got it mostly working, but when I've got one node, and I add another node, the first node loses its value.

A memory-efficient implementation of a doubly linked list is possible to have without compromising much timing efficiency. A clever design would give us a canonical set of primitive operations for ...