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 wind flapped loose, the wind was still,
Shaken out dead from tree and hill:
I had walked on at the wind’s will,—
I sat now, for the wind was still.”
—Dante Gabriel Rossetti (1828–1882)
“Ah, I fancy it is just the same with most of what you call your “emancipation.” You have read yourself into a number of new ideas and opinions. You have got a sort of smattering of recent discoveries in various fields—discoveries that seem to overthrow certain principles which have hitherto been held impregnable and unassailable. But all this has only been a matter of intellect, Miss West—superficial acquisition. It has not passed into your blood.”
—Henrik Ibsen (1828–1906)