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:
““Where the tree of knowledge stands, there is always paradise”: thus speak the oldest and the youngest serpents.”
—Friedrich Nietzsche (1844–1900)
“Of the Shaker society, it was formerly a sort of proverb in the country, that they always sent the devil to market.”
—Ralph Waldo Emerson (1803–1882)