Chapter 4, lesson2: Working with Sequential Lists.

Sequential lists - a colln of objects that is to be dealt with as one, rather than accessed individually. Having access to the middle of the list is of little use here.

Queue

• FIFO structure - putting items in + taking them out.
• Enqueue, Dequeue, Count, Peek.
• Enqueue - can add nulls, so cannot test result of Dequeue or peek, to test for empty - use Count.

Stack

• Push, Pop, Cout, Peek.