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:
“The body in the grave is like the tree in winter; they conceal their greenness under a show of dryness.... We too must wait for the springtime of the body.”
—Marcus Minucius Felix (2nd or 3rd cent. A.D.)
“The conclusion has never changed: the worst sort of people come here for the worst sort of reasons and put upon those of us who have conveniently forgotten where we came from and how we got here.”
—Anna Quindlen (b. 1952)