Overview
This module sets the foundation for seven lessons that cover foundational data structures: linked lists, stacks, queues, hash tables, sets, binary trees, AVL trees, tries, and graphs.
Prerequisites
- None specified
Learning Objectives
By the end of this module, learners will be able to:
- explain the basics of several computer science data structures, including linked lists, stacks, queues, hash tables, sets, binary trees, AVL trees, tries, and graphs.
Data Set Lessons
| Suggested Order | Lesson name | Exercises | Difficulty |
|---|---|---|---|
| 1 | Intro to Data Structures | none | Easy |
| 2 | Linked Lists | Implementing a Linked List | Moderate |
| 3 | Stacks and Queues | Bracket Matching | Easy |
| 4 | Hash Tables | Implementing a Hash Table | Moderate |
| 5 | Sets | Implementing a Set | Easy |
| 6 | Binary Trees and Tries | Implementing a Binary Tree; Implementing an AVL Tree | Difficult |
| 7 | Graphs | Implementing a Graph | Difficult |
Content
- Lesson: Intro to Data Structures
Time to Complete
30 min total:
- 30 min - Intro to Data Structures
Internal resources
Find a 👾 bug 👾 or have suggestions? Let us know!