LECTURE 7: More Lists
Ch. 4.8 of Data Structures in Pascal (Horowitz). DL 3.4 and 3.5, Cormen 11.2
(7.1) Implementation of Generalized Lists.
(7.2) PrintList and ReadList of Generalized Lists.
(7.3) Equal of generalized Lists.
(7.4) Traversals. Inversion
(7.5) Doubly Linked Lists. Sentinels.

LECTURE 8: REMAINING TOPICS FROM LISTS PLUS DICTIONARY ADT. DL 6.1 + 6.2
8.1 Definition of Dictionary ADT.
8.2 Simple list representation.
(Briefly describe performance if held as ordered lists (linked list and array)).
8.3 Expected cost if probabilities are equal.
8.4 Expected cost, Copt, if ordered by probabilities.
8.5 Demonstration that Copt is the optimum.
8.6 Move to Front Heuristic. Gives twice the optimum (without demonstration).
8.7 Transpose Heuristic.