Module 4: Index Structures
Lecture 15: Range Trees and Interval Trees
Analysis of range trees
Storage space is
Time taken is
Search in
and identify left-most and right-most leaf nodes
and
that cover
's range
Find
least common ancestor
of
and
Perform range search for dimensions
for all range trees rooted at nodes between
and
and
and
Fractional cascading
improves search time in 2 dimensions to
and identify left-most and right-most leaf nodes
and 
that cover 
of 
for all range trees rooted at nodes between 