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:
“What he loved so much in the plant morphological structure of the tree was that given a fixed mathematical basis, the final evolution was so incalculable.”
—D.H. (David Herbert)
“We endeavour more that men should speak of us, than how and what they speak, and it sufficeth us that our name run in men’s mouths, in what manner soever. It seemeth that to be known is in some sort to have life and continuance in other men’s keeping.”
—Michel de Montaigne (1533–1592)