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:
“Strong to break dead things,
the young tree, drained of sap,
the old tree, ready to drop,
to lift from the rotting bed
of leaves, the old
crumbling pine tree stock.”
—Hilda Doolittle (1886–1961)
“I think ... I have inside me a sort of answer to the want of today: to the real, deep want of the English people, not to just what they fancy they want. And gradually, I shall get my hold on them.”
—D.H. (David Herbert)