Tree Basics & Tricks
Tree terminology, traversals, and a few practical iterative traversal tricks
Zürich night over Limmat
Tree terminology, traversals, and a few practical iterative traversal tricks
Hash tables from direct addressing to chaining and open addressing, with probe analysis
Doubly linked lists with and without sentinels, plus search/insert/delete pseudocode
Priority queue via max-heap: extract-max, increase-key, insert, and heapify mechanics
Stack and circular queue pseudocode with overflow/underflow checks and wrap-around logic
Bucket sort for roughly uniform inputs, with insertion sort per bucket and runtime notes