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:
“No doubt, the short distance to which you can see in the woods, and the general twilight, would at length react on the inhabitants, and make them savages. The lakes also reveal the mountains, and give ample scope and range to our thought.”
—Henry David Thoreau (1817–1862)
“I expect a time when, or rather an integrity by which, a man will get his coat as honestly and as perfectly fitting as a tree its bark. Now our garments are typical of our conformity to the ways of the world, i.e., of the devil, and to some extent react on us and poison us, like that shirt which Hercules put on.”
—Henry David Thoreau (1817–1862)