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:
“If you believe in the soul, do not clutch at sensual sweetness before it is ripe on the slow tree of cause and effect.”
—Ralph Waldo Emerson (1803–1882)
“Every civilization when it loses its inner vision and its cleaner energy, falls into a new sort of sordidness, more vast and more stupendous than the old savage sort. An Augean stable of metallic filth.”
—D.H. (David Herbert)