A data structure holding many values, possibly of differeNT types, which is usually accessed sequeNTially, working from the head to the end of the tail - an "ordered list". This coNTrasts with a (one-dimensional) array, any elemeNT of which can be accessed equally quickly. Lists are often stored using a cell and poiNTer arrangemeNT where each value is stored in a cell along with an associated poiNTer to the next cell. A special poiNTer, e.g. zero, marks the end of the list. This is known as a (singly) "linked list". A doubly linked list has poiNTers from each cell to both next and previous cells. An unordered list is a set. (1998-11-12)
