Welcome to the CS126 revision guide

Complete Notes

Given the large number of topics, it makes sense to break these down into broader topics when revising - each of which having its own page.

Or access the CS126 One Page Notes.

These were written by Edmund Goodman and Justin Tan with contributions from Leon Chipchase:

1. Arrays and Lists
2. Analysis of algorithms
3. Recursive algorithms
4. Stacks and Queues
5. Maps, hash tables and sets
6. Trees
7. Priority queues & Heaps
8. Skip lists
9. Self-balancing trees
10. Graphs
11. Directed Graphs
12. General algorithms