Interval Trees
Interval Trees. Store intervals of the form [ l i ,r i ], l i <= r i . An interval is stored in exactly 1 node. So, O(n) nodes. 3 versions. Differing capability. Version 1. Store intervals of the form [ l i ,r i ], l i <= r i . At least 1 interval per node. Static interval set.
759 views • 28 slides