Lecture notes on data structures

I began writing notes for my lectures on data structures. The notes are a work in progress, likely to contain errors and omissions of various kinds. If you find any mistakes or hard-to-understand parts, please let me know.

chapter version
All chapters in a single file 2024-03-11
01. Preliminaries 2023-09-22
02. Splay trees 2023-10-10
03. (a,b)-trees 2023-09-22
04. Heaps 2024-03-11
05. Caching 2023-09-22
06. Hashing 2023-11-15
07. Geometric data structures 2023-09-22
08. Strings 2023-09-22
09. Parallel data structures 2023-11-15

Extra chapters

Our students contributed several chapters on more advanced data structures. You can view the work in progress here.

chapter version author
50. Graph data structures 2021-09-21Ondřej Mička
51. Dynamization 2021-09-21Václav Končický
52. Persistence 2021-09-21Jiří Škrobánek
53. Space-efficient data structures 2021-09-21Filip Štědronský
54. Streaming algorithms 2021-09-21Parth Mittal
This page is maintained by Martin Mareš