Discussion Outline
Session 12

Current material

• The Queue ADT & its linked list implementation
• The Stack ADT & its linked list implementation

Project 5

• Dequeue should now return a nodePtr, rather than an int, since, in this case, we don't want to be freeing memory and reallocating it a line or 2 later.
• The TAs will draw pictures that illustrate the train problem.
• You must solve the problem using stacks and queues and must obey the rules of stacks and queues. You may NOT solve the problem using general linked lists. This means that only one car may be moved at a time (not 3).