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 L and R
    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