Doubly Linked-List
Doubly linked lists with and without sentinels, plus search/insert/delete pseudocode
Zürich night over Limmat
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
Radix sort from least-significant digit upward, and why stability is required
Decision trees for comparison sorts, and why comparison sorting needs Ω(n log n)