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:
“The spring is here, young and beautiful as ever, and absolutely shocking in its display of reckless maternity; but the Judas tree will bloom for you on the Bosphorus if you get there in time. No one ever loved the dog-wood and Judas tree as I have done, and it is my one crown of life to be sure that I am going to take them with me to heaven to enjoy real happiness with the Virgin and them.”
—Henry Brooks Adams (1838–1918)
“In early times every sort of advantage tends to become a military advantage; such is the best way, then, to keep it alive. But the Jewish advantage never did so; beginning in religion, contrary to a thousand analogies, it remained religious. For that we care for them; from that have issued endless consequences.”
—Walter Bagehot (1826–1877)