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:
“A pinecone does not fall far from the tree trunk.”
—Estonian. Trans. by Ilse Lehiste (1993)
“We thought it would be worth the while to read the epitaphs where so many were lost at sea; however, as not only their lives, but commonly their bodies also, were lost or not identified, there were fewer epitaphs of this sort than we expected, though there were not a few. Their graveyard is the ocean.”
—Henry David Thoreau (1817–1862)