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:
“And out of the ground made the Lord God to grow every tree that is pleasant to the sight, and good for food: the tree of life also in the midst of the garden, and the tree of knowledge of good and evil. And a river went out of Eden to water the garden.”
—Bible: Hebrew Genesis 2:9-10.
“Not being a K.N. [Know-Nothing] I am left as a sort of waif on the political sea with symptoms of a mild sort towards Black Republicanism.”
—Rutherford Birchard Hayes (1822–1893)