Reminder that you must complete the pre-reading before each class.

On this page:
✔️ Pre-reading for Tuesday 6/22
✔️ Pre-reading for Wednesday 6/23
✔️ Pre-reading for Thursday 6/24

---

Pre-Reading for Queues

Essential Questions

✔️ What is a the purpose of a queue?
✔️ What is the behaviour of a queue?
✔️ How can a queue be implemented using a linked list?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Data Structure and Algorithms - Queue
• Watch Data Structures: Queue (Abstract Data Type) (7 min)
• Read How to implement a queue using a linked list
• Watch Data Structures: Linked List implementation of Queue (14 min)

---

Pre-Reading for Stacks

Essential Questions

Before attending class, please complete the material below and use the following questions to guide your note-taking:

✔️ What is a the purpose of a stack?
✔️ What is the behaviour of a stack?
✔️ How can a stack be implemented using a linked list?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Data Structure and Algorithms - Stack
• Watch Data Structures: Stack (Abstract Data Type) (8 min)
• Read How to implement a stack in C using a linked list
• Watch Data Structures: Linked List implementation of stacks (11 min)

---

Pre-Reading for Priority Queues

Essential Questions

✔️ What is a the purpose of a priority queue?
✔️ What is the behaviour of a priority queue?
✔️ How can a priority queue be implemented using a queue?

Read/Watch/Review

Before attending class, please complete the material below:

• Read Data Structure - Priority Queue
  • Ignore their implementation code as they use arrays which we won’t be using for ours.
• Read Background Info, Lab 14