Module 4: Index Structures
  Lecture 15: Range Trees and Interval Trees
 

                                           

 

Range tree
  • In 1-dimension, similar to a balanced binary search tree
  • Leaves are sorted and doubly linked
  • Range search proceeds by descending to the leaf <= to the minimum
    of the range
  • Then, traverse forward pointers till maximum of the range is exceeded
  • Time taken is where is size of the answer set
  • Space is