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:
“It never had been inside the room,
And only one of the two
Was afraid in an oft-repeated dream
Of what the tree might do.”
—Robert Frost (1874–1963)
“There are people who can write their memoirs with a reasonable amount of honesty, and there are people who simply cannot take themselves seriously enough. I think I might be the first to admit that the sort of reticence which prevents a man from exploiting his own personality is really an inverted sort of egotism.”
—Raymond Chandler (1888–1959)