treesort (1)


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 ...)

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



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 12 February 2019.
HTML page formatted Wed Mar 13 12:42:46 2019.

Cite this as:
Paul E. Black, "treesort (1)", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 12 February 2019. (accessed TODAY) Available from: