Outline:

1. Questions?
2. Recap: stack ADT and linked lists
3. Building a stack with a linked list: Exercise
4. Other implementations:
   • mutable list
   • fixed array
   • growing array
   • time complexity
5. Wrap-up

What’s next

Upcoming assessments:

• Assignment 3 is due tonight
• Quiz 3 will be next Monday and cover the following Quiz Learning Objectives:
  • Core:
    • LT 3: linked lists
    • LT 4: core linked-list time complexity
  • Advanced:
    • OO 3: inheritance
    • LT 6: linked-list time complexity
    • SQ 5: stack time complexity
  • Repeats from before (not guaranteed, but maybe):
    • KF 4: functions (CR)
    • OO 1: objects (CR)

What you should do now:

• The readings (see below)
• Finish Assignment 3 and submit it by tonight
• Look at feedback from Assignment 1 and Assignment 2 and work on a resubmission – see the resubmission policy for more info!

Reading assignment (to be completed by the next class):

Queues (for next time):

• Queues