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:
“Some say that happiness is not good for mortals, & they ought to be answered that sorrow is not fit for immortals & is utterly useless to any one; a blight never does good to a tree, & if a blight kill not a tree but it still bear fruit, let none say that the fruit was in consequence of the blight.”
—William Blake (1757–1827)
“His moving impulse is no flabby yearning to teach, to expound, to make simple; it is that “obscure inner necessity” of which Conrad tells us, the irresistible creative passion of a genuine artist, standing spell-bound before the impenetrable enigma that is life, enamoured by the strange beauty that plays over its sordidness, challenged to a wondering and half-terrified sort of representation of what passes understanding.”
—H.L. (Henry Lewis)