P4: Dictionaries

This session is about dictionaries and seeing exercises from past Midterm exams.

The theoretical tools we use are:

• Hash tables with separate chaining,
• Binary Search Trees (BST) and AVL trees.

We solve some problems from the EDA ProblemSet, section 3 Dictionaries.

After class

To test your understanding, try exercises from the Collection of Solved Exams. For instance:

• 15/04/2021 Midterm EDA Exam Problem 1.d
• 02/11/2023 Midterm EDA Exam Problem 1.c