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:
“Even when seen from near, the olive shows
A hue of far away. Perhaps for this
The dove brought olive back, a tree which grows
Unearthly pale, which ever dims and dries,
And whose great thirst, exceeding all excess,
Teaches the South it is not paradise.”
—Richard Wilbur (b. 1921)
“This sort of gingerbread is baked daily and more sedulously than pure wheat or rye- and-Indian in almost every oven, and finds a surer market.”
—Henry David Thoreau (1817–1862)