[vrwhazvo] Interval tree

The interval tree (segment tree) strikes me as the "next most interesting" data structure after the associative array. Instead of querying for single items in an associative array, an interval tree permits querying for a continuous range. Kind of like Cantor's hierarchy of infinities.

While many programming languages are beginning to have maps built-in to the language or in standard libraries, not yet for intervals, though they are available in additional libraries. I read about their implementation using 2-3 finger trees in Haskell.