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 tree there is that from its topmost bough
Is half all glittering flame and half all green
Abounding foliage moistened with the dew;
And half is half and yet is all the scene;
And half and half consume what they renew....”
—William Butler Yeats (1865–1939)
“Everywhere—all over Africa and South America ... you see these suburbs springing up. They represent the optimum of what people want. There’s a certain sort of logic leading towards these immaculate suburbs. And they’re terrifying, because they are the death of the soul.... This is the prison this planet is being turned into.”
—J.G. (James Graham)