Data Structures19 sections · 729 units
Open in Course

Section Recap

What you learned

Interval trees handle range overlap queries.

Core Operations: Insert interval, delete interval, find overlapping intervals.

Augmented BST: Store intervals in BST by start.

Each node tracks max end in subtree.

Sweep Line: Process interval endpoints in order.

Track active intervals.

Common Problems: Meeting rooms, merge intervals, insert interval, skyline. Time: O(logn)O(\log n) per operation. Space: O(n)O(n).