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:
“It is, I fear, but a vain show of fulfilling the heathen precept, “Know thyself,” and too often leads to a self-estimate which will subsist in the absence of that fruit by which alone the quality of the tree is made evident.”
—George Eliot [Mary Ann (or Marian)
“It’s red hot, mate. I hate to think of this sort of book getting in the wrong hands. As soon as I’ve finished this, I shall recommend they ban it.”
—Tony Hancock (1924–1968)