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:
“To find the length of an object, we have to perform certain
physical operations. The concept of length is therefore fixed when the operations by which length is measured are fixed: that is, the concept of length involves as much as and nothing more than the set of operations by which length is determined.”
—Percy W. Bridgman (1882–1961)
“I saw the spiders marching through the air,
Swimming from tree to tree that mildewed day
In latter August when the hay
Came creaking to the barn.”
—Robert Lowell (1917–1977)