NIST

treesort (1)

(algorithm)

Definition: A sort algorithm that first builds a binary search tree of the keys, then accesses the keys with an in-order traversal.

Generalization (I am a kind of ...)
sort.

Aggregate child (... is a part of or used in me.)
binary search tree, in-order traversal.

See also blind sort, treesort (2), heapsort.

Note: For good performance, use a balanced binary search tree.

Author: PEB

Implementation

(C)

More information

[GBY91, page 182].


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 16 November 2009.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Paul E. Black, "treesort (1)", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 16 November 2009. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/treesort1.html