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 | 2022-02-01 |
01. Preliminaries | 2020-02-21 |
02. Splay trees | 2022-02-01 |
03. (a,b)-trees | 2021-11-11 |
04. Heaps | 2020-02-21 |
05. Caching | 2021-04-16 |
06. Hashing | 2021-06-05 |
07. Geometric data structures | 2021-05-18 |
08. Strings | 2022-02-01 |
09. Parallel data structures | 2021-06-18 |
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-21 | Ondřej Mička |
51. Dynamization | 2021-09-21 | Václav Končický |
52. Persistence | 2021-09-21 | Jiří Škrobánek |
53. Space-efficient data structures | 2021-09-21 | Filip Štědronský |
54. Streaming algorithms | 2021-09-21 | Parth Mittal |