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 scythers, Time and Death,
Helmed locusts, move upon the tree of breath;”
—Robert Lowell (1917–1977)
“Some minds are as little logical or argumentative as nature; they can offer no reason or “guess,” but they exhibit the solemn and incontrovertible fact. If a historical question arises, they cause the tombs to be opened. Their silent and practical logic convinces the reason and the understanding at the same time. Of such sort is always the only pertinent question and the only satisfactory reply.”
—Henry David Thoreau (1817–1862)