Prev
Next
All
Initialisation for an asymmetric doubly linked list
The list
head = 0;
An item
item->next = 0; item->prev = &item->next;
Makes deletion do nothing if item on no list