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:
“I expect a time when, or rather an integrity by which, a man will get his coat as honestly and as perfectly fitting as a tree its bark. Now our garments are typical of our conformity to the ways of the world, i.e., of the devil, and to some extent react on us and poison us, like that shirt which Hercules put on.”
—Henry David Thoreau (1817–1862)
“It seemed there was a sort of poisoning, an auto-infection of the organisms, so Dr. Krokowski said; it was caused by the disintegration of a substance ... and the products of this disintegration operated like an intoxicant upon the nerve-centres of the spinal cord, with an effect similar to that of certain poisons, such as morphia, or cocaine.”
—Thomas Mann (1875–1955)