4 Ucwlib defines two basic linked list structures: single-linked lists and circular linked lists.
5 Both of them support insertion of any number of nodes, removal of nodes and various searches.
6 Single-linked lists are a bit simplier (they especially requires smaller nodes)
7 but some operations need assymptoticaly more time.
9 Linked lists can be used very simply. We define a structure as list's handle and
10 a common header in all inserted nodes. All routines then accept and return pointers
11 to this handle and node headers.
23 Circular linked lists of simple items
24 -------------------------------------