Open Data Structures
Implement the classic data structures yourself — array lists, linked lists, hash tables, trees, heaps, and graphs — with the efficiency analysis that explains why they work. Derived and adapted from Pat Morin's 'Open Data Structures' (pseudocode/Python edition), released under the Creative Commons Attribution 2.5 Canada (CC BY 2.5 CA) license.
- Python
- 45 lessons
- ~9 hours
- Free
- by Pat Morin
Learn Python for free on Libre Academy with the Open Data Structures course: 45 interactive lessons you complete by writing real code in a built-in editor, graded instantly by hidden tests. No paywall, no sign-up — it runs in your browser and the free desktop app.
What you get
- Hands-on lessons with a real editor and instant, test-graded feedback.
- Free and open source — no account required to start.
- Runs in your browser, and offline in the free desktop app.
- Python runs in your browser.
What's inside
- Interfaces and Efficiency
- Array-Based Lists
- Linked Lists
- Skiplists: The Express Lane
- Hash Tables
- Binary Trees
- Binary Search Trees
- Staying Balanced: Scapegoat Trees
- Heaps
- Sorting Algorithms
- Graphs
- Wrap-Up and Credits