discrete interval encoding tree

(data structure)

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.

Author: PEB


insert, delete, and member (ML), insert, delete, and member (Haskell)

More information

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.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:45 2019.

Cite this as:
Paul E. Black, "discrete interval encoding tree", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: