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:
“I have come to the conclusion that the closer people are to what may be called the front lines of government ... the easier it is to see the immediate underbrush, the individual tree trunks of the moment, and to forget the nobility the usefulness and the wide extent of the forest itself.... They forget that politics after all is only an instrument through which to achieve Government.”
—Franklin D. Roosevelt (1882–1945)
“Raising children is a spur-of-the-moment, seat-of-the-pants sort of deal, as any parent knows, particularly after an adult child says that his most searing memory consists of an offhand comment in the car on the way to second grade that the parent cannot even dimly recall.”
—Anna Quindlen (b. 1952)