ABSTRACT
Used By: Buffer (Chapter 17), KDTree (Chapter 47), QuadTree (Chapter 48), AdjacencyMatrixRepresentation (Chapter 54), AdjacencyListRepresentation (Chapter 55)
Strengths: The doubly linked list is the only positional collection data structure that provides amortized constant time methods for all of the PositionalCollectionLocator methods except getCurrentPosition. Furthermore, it is a tracked implementation. Since a doubly linked list maintains a pointer from each element to the one that precedes it, an element that is known to be located near the end of the collection can be efficiently located by traversing backwards from the tail.
