Data structure for quick time interval look up

Question

I have a set of time intervals In = (an, bn). I need to run lots of look ups where I\'m given a time t and need to quickly return the intervals that conta

Answer 1

What you are looking for is an Interval Tree (which is a type of Range Tree).

These have logarithmic lookup time like other tree structures (e.g., RB trees), so you should see comparable performance to using something like a Java TreeMap or an STL map.

• Code for Red-black trees and interval trees from MIT
• There is a C++ implementation in the CGAL Library.
• Here's a C# Implementation