Data Structures
Ten units, ordered roughly the way most courses teach them — from the simplest way to hold data in memory, through to the structures that make fast lookup and search possible. Each one opens into its own page with notes, a small diagram, and a quick quiz.
Arrays & Strings
Contiguous storage, index access, the basics everything else builds on.
02Linked Lists
Nodes and pointers — flexible insertion without shifting memory around.
03Stacks & Queues
Controlling order of access: last-in-first-out vs first-in-first-out.
04Trees & BSTs
Hierarchies that make searching and organizing data fast.
05Graphs
Nodes and edges for modelling networks, routes, and relationships.
06Hashing
Mapping keys to values for near-instant lookup.
07Sorting Techniques
Putting data in order efficiently — and why the method matters.
08Searching Techniques
Finding what you need, from linear scans to binary search.
09Arrays vs Linked Lists
An interactive, side-by-side look at the trade-off that started it all.
10Binary search trees
The better visualisation of trees.
// most units include notes + a short interactive quiz; Units 09 & 10 are hands-on visual labs