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 great pines stand at a considerable distance from each other. Each tree grows alone, murmurs alone, thinks alone. They do not intrude upon each other. The Navajos are not much in the habit of giving or of asking help. Their language is not a communicative one, and they never attempt an interchange of personality in speech. Over their forests there is the same inexorable reserve. Each tree has its exalted power to bear.”
—Willa Cather (1873–1947)
“In literary circles, the men of trust and consideration, bookmakers, editors, university deans and professors, bishops, too, were by no means men of the largest literary talent, but usually of a low and ordinary intellectuality, with a sort of mercantile activity and working talent. Indifferent hacks and mediocrities tower, by pushing their forces to a lucrative point, or by working power, over multitudes of superior men, in Old as in New England.”
—Ralph Waldo Emerson (1803–1882)