This final tutorial in the Data structures and algorithms series introduces searching and sorting with doubly-linked lists and circular-linked lists.

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 ...