Editing Interval tree (section)

==Naive approach==
In a simple case, the intervals do not overlap and they can be inserted into a simple [[binary search tree]] and queried in <math>O(\log n)</math> time. However, with arbitrarily overlapping intervals, there is no way to compare two intervals for insertion into the tree since orderings sorted by the beginning points or the ending points may be different. A naive approach might be to build two parallel trees, one ordered by the beginning point, and one ordered by the ending point of each interval. This allows discarding half of each tree in <math>O(\log n)</math> time, but the results must be merged, requiring <math>O(n)</math> time. This gives us queries in <math>O( n + \log  n) = O( n)</math>, which is no better than brute-force.

Interval trees solve this problem. This article describes two alternative designs for an interval tree, dubbed the ''centered interval tree'' and the ''augmented tree''.