Skip to main content
. 2016 Jul 19;8:29–38. doi: 10.4137/BII.S38916

Table 3.

Comparison of operation time between multiple interval tree data structures.

IT0 IT1 IT2 IT2
Allen’s interval algebra queries O(log2 n + k) for o, oi and d NA NA O(log n + k)
Stabbing-max query NA O(log n) O(log n) NA
Insertion O(log n) O(log n)* O(log n)* O(log n)*
Deletion O(log n) O(log n log log n)* O(log n)* O(log n)*

Note:

*

Amortized time.