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:
“Sorrow is knowledge: they who know the most
Must mourn the deepest o’er the fatal truth,
The Tree of Knowledge is not that of Life.”
—George Gordon Noel Byron (1788–1824)
“And would you be a poet
Before you’ve been to school?
Ah, well! I hardly thought you
So absolute a fool.
First learn to be spasmodic—
A very simple rule.
For first you write a sentence,
And then you chop it small;
Then mix the bits, and sort them out
Just as they chance to fall:
The order of the phrases makes
No difference at all.”
—Lewis Carroll [Charles Lutwidge Dodgson] (1832–1898)