Interval Tree Search
Interval Tree Search Interval tree search finds all intervals that overlap a given query interval. It extends a binary search tree by storing interval metadata at each node to support efficient range queries. Each node represents an interval and maintains auxiliary information to guide pruning during search. Problem Given a set of intervals and a query interval $[q_l, q_r]$, find all intervals $[l, r]$ such that: $$ l \le q_r...