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:
“You are wind in a stark tree,
you are the stark tree unbent,
you are a strung bow,
you are an arrow.”
—Hilda Doolittle (1886–1961)
“Self-interest speaks all sort of languages, and plays all sort of roles—even that of disinterest.”
—François, Duc De La Rochefoucauld (1613–1680)