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:
“He thought he saw an Elephant,
That practiced on a fife:
He looked again, and found it was
A letter from his wife.
“At length I realize,” he said,
“The bitterness of Life!””
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)
“It never had been inside the room,
And only one of the two
Was afraid in an oft-repeated dream
Of what the tree might do.”
—Robert Frost (1874–1963)