Data Structures -> Interval Trees

Augmented BST for one live set of half-open intervals, supporting online insert / erase and any-overlap queries through subtree max-right summaries.

• Topic slug: data-structures/interval-trees
• Tutorial page: Open tutorial
• Ladder page: Open ladder
• Repo problems currently tagged here: 1
• Repo companion pages: 6
• Curated external problems: 1

Microtopics

• half-open-intervals
• interval-overlap
• subtree-max-right
• augmented-bst
• stabbing-search
• dynamic-interval-set

Learning Sources

Source	Type
Introduction to Algorithms, 4th ed. TOC PDF	Reference
AOJ 0360 Reservation System	Practice

Repo Companion Material

Material	Type
Interval Tree hot sheet	quick reference
Template Library exact starter route	starter route
Reservation System note	anchor note
Balanced BSTs For Contests	compare point
Heaps And Ordered Sets tutorial	compare point
ODT / Chtholly tutorial	compare point

Curated External Problems

Core

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Reservation System	AOJ	Easy	Interval Tree, Interval Overlap	Data-Structure-Heavy; Query-Heavy	Half-Open Interval Overlap; Dynamic Interval Set; Subtree Max-Right	Half-Open-Intervals; Overlap-Query; Augmented-Bst	A gentle first benchmark where the real invariant is 'does the new interval overlap anything in the live set?', so subtree max-right augmentation can be practiced directly even though a lighter ordered-set route also exists.

Repo Problems

Code	Title	Fit	Difficulty	Pattern	Note	Solution
RESERVATIONSYSTEM	Reservation System	primary	easy	-	Note	Code

Regeneration

python3 scripts/generate_problem_catalog.py