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:
“I said I had the tree. It wasn’t true.
The opposite was true. The tree had me.
The minute it was left with me alone,
It caught me up as if I were the fish
And it the fishpole.”
—Robert Frost (1874–1963)
“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)