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:
“It is the vice of our public speaking that it has not abandonment. Somewhere, not only every orator but every man should let out all the length of all the reins; should find or make a frank and hearty expression of what force and meaning is in him.”
—Ralph Waldo Emerson (1803–1882)
“If you believe in the soul, do not clutch at sensual sweetness before it is ripe on the slow tree of cause and effect.”
—Ralph Waldo Emerson (1803–1882)