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:
“Men sometimes speak as if the study of the classics would at length make way for more modern and practical studies; but the adventurous student will always study classics, in whatever language they may be written and however ancient they may be. For what are the classics but the noblest recorded thoughts of man?... We might as well omit to study Nature because she is old.”
—Henry David Thoreau (1817–1862)
“Hang there like fruit, my soul,
Till the tree die!”
—William Shakespeare (1564–1616)