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:
“Gray, dear friend, is all theory,
But green the golden tree of life.”
—Johann Wolfgang Von Goethe (1749–1832)
“There is a sort of love whose very excessiveness prevents the lover’s being jealous.”
—François, Duc De La Rochefoucauld (1613–1680)