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:
“On every tree a bucket with a lid,
And on black ground a bear-skin rug of snow.
The sparks made no attempt to be the moon.
They were content to figure in the trees
As Leo, Orion, and the Pleiades.
And that was what the boughs were full of soon.”
—Robert Frost (1874–1963)
“Nietzsche, to the end of his days, remained a Russian pastor’s son, and hence two-thirds of a Puritan; he erected his war upon holiness, toward the end, into a sort of holy war.”
—H.L. (Henry Lewis)