Data Strcutures
\(O(\cdot)\) and \(\Omega (\cdot)\) notation; amortized analysis; Array-lists notes
Stacks, Queues, Steques, and Quacks: notes
Array-lists concatenation, tombstones notes
Scapegoat tree insertion analysis; augmented binary search trees
Mergeable priority queues; Leftist heaps, binomial heaps notes
Faster priority queues: Fibonacci heaps and pairing heaps notes
Range-minimum and lowest-common-ancestor queries notes