Definition: A binary search tree that stores consecutive values as intervals.
Also known as diet.
Generalization (I am a kind of ...)
binary search tree.
Note: Each node is an interval signifying consecutive values, instead of a single value. This saves space and time if there are many sets of consecutive values.
Discrete Interval Encoding Trees with links to implementations. Abstract and links to full text of Diets for Fat Sets from Journal of Functional Programming, Vol. 8, No. 6, 1998.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "discrete interval encoding tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/discretintrv.html