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:
“No tree is so wedded to the water, and harmonizes so well with still streams.”
—Henry David Thoreau (1817–1862)
“In the operative opinion of the world, he who is already fully provided with what is necessary for him, that man shall have more; while he who is deplorably destitute of the same, he shall have taken away from him even that which he hath. Yet the world vows it is a very plain, downright matter-of-fact, plodding, humane sort of world.”
—Herman Melville (1819–1891)