http://logic.pdmi.ras.ru/midas/?q=en/courses#datastructures

Classical data structures and their recent variants:

* Binary Search Trees:
o Balanced trees, including rank-balanced trees, red-black trees, left-leaning trees.
o Maintaining balance without rebalancing on deletion.
o Self-adjusting trees.
* Heaps (priority queues):
o Implicit heaps.
o Binomial heaps.
o Rank-pairing heaps.
o Soft heaps (if time permits).