This unit covers two types of Segment Trees, namely regular and lazy, and how to solve classical dynamic range query problems. Complementary notes can be found in section 2.4.3 of the book Competitive Programming 3.
- Unit 1: Complexity
- Unit 2: Linear data structures
- Unit 4: Tree data structures (esp. binary trees)
- UVa 12086 - Potentiometers
- UVa 11235 - Frequent values
- UVa 11402 - Ahoy, Pirates!