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:
“Hang there like fruit, my soul,
Till the tree die!”
—William Shakespeare (1564–1616)
“There is a sort of homely truth and naturalness in some books which is very rare to find, and yet looks cheap enough. There may be nothing lofty in the sentiment, or fine in the expression, but it is careless country talk. Homeliness is almost as great a merit in a book as in a house, if the reader would abide there. It is next to beauty, and a very high art. Some have this merit only.”
—Henry David Thoreau (1817–1862)