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

                                           

 

Interval tree
  • Binary tree
  • Each node storing 5 different pieces of information:
 
  • Bookkeeping to avoid duplication of segments with both end-points in the window
 
  • Median point
 
  • Left child pointer for intervals ending before
 
  • Right child pointer for intervals starting after
 
  • Lists storing all overlapping intervals
 
  • Left list sorted in ascending order by left end-points
 
  • Right list sorted in descending order by right end-points