(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 December 2007.
HTML page formatted Thu Aug 14 12:18:08 2008.
Cite this as:
Paul E. Black, "treesort (1)", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 December 2007. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/treesort1.html
