Interval, Segment, Range, and Priority Search Trees
D. T. Lee
Academia Sinica
Hung-I Yu
Academia Sinica
Construction of Interval Trees•Example and Its Applications
Construction of Segment Trees•Examples and Its Applications
Construction of Range Trees•Examples and Its Applications
Construction of Priority Search Trees•Examples and Its Applications
In this chapter, we introduce four basic data structures that are of fundamental importance and have many applications as we will briefly cover them in later sections. They are interval trees, segment trees, range trees, and priority search trees. Consider for ...
Get Handbook of Data Structures and Applications, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
