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’s a tree on a riverbank: how long can it survive?”
—Punjabi proverb, trans. by Gurinder Singh Mann.
“Irony, forsooth! Guard yourself, Engineer, from the sort of irony that thrives up here; guard yourself altogether from taking on their mental attitude! Where irony is not a direct and classic device of oratory, not for a moment equivocal to a healthy mind, it makes for depravity, it becomes a drawback to civilization, an unclean traffic with the forces of reaction, vice and materialism.”
—Thomas Mann (1875–1955)