A tree sort is a sort algorithm that builds a binary search tree from the keys to be sorted, and then traverses the tree (in-order) so that the keys come out in sorted order. Its typical use is when sorting the elements of a stream from a file. Several other sorts would have to load the elements to a temporary data structure, whereas in a tree sort the act of loading the input into a data structure is sorting it.
Read more about Tree Sort: Efficiency, Example
Famous quotes containing the words tree and/or sort:
“A fool sees not the same tree that a wise man sees.”
—William Blake (1757–1827)
“As to “Don Juan,” confess ... that it is the sublime of that there sort of writing; it may be bawdy, but is it not good English? It may be profligate, but is it not life, is it not the thing? Could any man have written it who has not lived in the world? and tooled in a post-chaise? in a hackney coach? in a Gondola? against a wall? in a court carriage? in a vis a vis? on a table? and under it?”
—George Gordon Noel Byron (1788–1824)