Data Structures
Arrays, lists, trees, hash tables and their trade-offs.
Data Structures is taught here in 3 lessons, running from Arrays, linked lists, stacks and queues through to Trees and choosing a structure. Each lesson takes one topic, shows the working code, and links onward to the next, so the course can be read straight through in order.
| Track | Computer Science Fundamentals |
| Lessons | 3 |
| Level | Beginner |
| Reading time | about 39 minutes |
| Prerequisites | Helpful, but not required: Algorithms |
Lessons
- Arrays, linked lists, stacks and queuesContiguous memory versus pointers, why pop from the front is the classic performance mistake, and how to pick a container.
- Hash tablesHow hashing turns a key into a slot, what collisions and load factor do to performance, and what makes a key usable.
- Trees and choosing a structureBinary search trees, why balance decides everything, heaps for priority, and a decision table for real code.
More in Computer Science Fundamentals
Algorithms Computer Networks Operating Systems Character Encodings Hashing & Checksums Data Formats Dates & Time Regular Expressions
FAQ
How long does the Data Structures course take?
It has 3 lessons, about 39 minutes of reading. Expect roughly twice that if you type out and run every example.
Do I need prior experience for Data Structures?
Not strictly. It helps to have read Algorithms first, because some lessons build on it, but every lesson explains its own assumptions.
What should I read after Data Structures?
Continue with Computer Networks (3 lessons), the next course in Computer Science Fundamentals.
Last refreshed 2026-09-18.