These data structures can be indexed in big O of n time.
Problematic instances of these data structures are found with algorithms named for Floyd and Brent. Several of these data structures are combined in a probabilistic data structure comparable to balanced trees. These data structures can be indexed in big O of n time. CAR and CDR are used for these structures in LISP, and stacks and queues are most often implemented using them. Sentinel nodes are used in implementations of these structures to make the last element point to something other than null. For 10 points, name these data structures, a type of list where each node contains a pointer to the next one.
Problematic instances of these data structures are found with algorithms named for Floyd and Brent.
Linked Lists [prompt on Lists]