Medial/length Oriented Tree
Similar to Augmented tree, but in a symmetrical way, where the Binary Search Tree is ordered by the Medial point of intervals. And there is a Maximum-oriented Binary Heap in every node, ordered by the length of interval (or half of the length). Also we store minimum possible value of the subtree in each node, additional to maximum possible value (this is how it is symmetrical).
Read more about this topic: Interval Tree
Famous quotes containing the words length and/or tree:
“Oft have I mused, but now at length I find,
Why those that die, men say they do depart.”
—Sir Philip Sidney (1554–1586)
“The tree of Knowledge is a Tree of Knowledge of good and evil.”
—Henry David Thoreau (1817–1862)