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:
“There is something singularly grand and impressive in the sound of a tree falling in a perfectly calm night like this, as if the agencies which overthrow it did not need to be excited, but worked with a subtle, deliberate, and conscious force, like a boa-constrictor, and more effectively then than even in a windy day.”
—Henry David Thoreau (1817–1862)
“Why should I seek for love or study it?
It is of God and passes human wit;
I study hatred with great diligence,
For that’s a passion in my own control,
A sort of besom that can clear the soul
Of everything that is not mind or sense.”
—William Butler Yeats (1865–1939)