Mo 17-19, Tu 17-19 G29-335
We have a look at asymptotically efficient data structures, especially data structures for geometric problems. Among other structures, we discuss heaps, augmented balanced binary search trees, range trees, interval trees, priority search trees, segment trees, and point location data structures. Furthermore, we will discuss data structuring techniques like making data structures (partially) persistent and making data structures dynamic.
There is a moodle for this course. Please register for the course in