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:
“At length to hospital
This man was limited,
Where screens leant on the wall
And idle headphones hung.
Since he would soon be dead
They let his wife come along
And pour out tea, each day.”
—Philip Larkin (1922–1986)
“No tree is so wedded to the water, and harmonizes so well with still streams.”
—Henry David Thoreau (1817–1862)