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:
“Blessed is the man that walketh not in the counsel of the ungodly,
nor standeth in the way of sinners, nor sitteth in the seat of the
scornful.
But his delight is in the law of the Lord; and in his law doth he
meditate day and night.
And he shall be like a tree planted by the rivers of water, that
bringeth forth his fruit in his season; his leaf also shall not wither;
and whatsoever he doeth shall prosper.”
—Bible: Hebrew Psalm I (l. I, 1–3)
“Anything that makes you laugh. But the finest sort draws a tear along with the laugh.”
—George Bernard Shaw (1856–1950)