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:
“a big picture of K. Marx with an axe,
“Where I cut off one it will never grow again.”
O Karl would it were true
I’d put my saw to work for you
& the wicked social tree would fall right down.”
—Gary Snyder (b. 1930)
“To people off alone, as we were, there is something stirring about finding evidences of human labour and care in the soil of an empty country. It comes to you as a sort of message, makes you feel differently about the ground you walk over every day.”
—Willa Cather (1873–1947)