Binary Search Tree (BST)
Binary search trees: core operations, successors, insertion, and deletion via transplant
Zürich night over Limmat
Binary search trees: core operations, successors, insertion, and deletion via transplant
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