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.
“Young women ... you are, in my opinion, disgracefully ignorant. You have never made a discovery of any sort of importance. You have never shaken an empire or led an army into battle. The plays by Shakespeare are not by you, and you have never introduced a barbarous race to the blessings of civilization. What is your excuse?”
—Virginia Woolf (1882–1941)