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:
“Sir, he throws away his money without thought and without merit. I do not call a tree generous that sheds its fruit at every breeze.”
—Samuel Johnson (1709–1784)
“They are a sort of post-house,where the Fates
Change horses, making history change its tune,
Then spur away o’er empires and o’er states,
Leaving at last not much besides chronology,
Excepting the post-obits of theology.”
—George Gordon Noel Byron (1788–1824)