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:
“On a tree by a river a little tom-tit
Sang “Willow, titwillow, titwillow!”
And I said to him, “Dicky-bird, why do you sit
Singing, ‘Willow, titwillow, titwillow’?
Is it a weakness of intellect, birdie?” I cried,
“Or a rather tough worm in your little inside?””
—Sir William Schwenck Gilbert (1836–1911)
“Am I your self
But as it were in sort or limitation,
To keep with you at meals, comfort your bed,
And talk to you sometimes?”
—William Shakespeare (1564–1616)