LECTURE 5
(5.1) Abstract Data Type of Lists
(5.2) Stacks
(5.2.1) Abstract Operations of Stacks
(5.2.2) Implementation of Stacks as Arrays
(5.3) Queues
(5.3.1) Abstract Operations of Queues
(5.3.2) Implementation of Queue as Arrays
(5.4) Linked lists
(5.4.1) Implementation of Stack as linked list.
(5.4.2) Implementation of Queue as linked list.
(5.4.3) Insert and Delete anywhere in the list.
(5.5) Advantages/disadvantages of continous vs dynamic memory.

LECTURE 6: MORE LISTS
CH3 of DL and Ch. 4 of Data Structures in Pascal (Horowitz).
(6.1) Insert, Delete and Access in Lists.
(6.2) Postfix notation.
(6.3) Infix to Postfix algorithm.
(6.4) Explain postfix evaluation (homework is to do it).
(6.5) Input/Output of Lists ( recursive and non-recursive).
PrintList0(), PrintList(), ReadList0(), ReadList()
(6.6) Generalized Lists, definitions