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 windy springs and the blazing summers, one after another, had enriched and mellowed that flat tableland; all the human effort that had gone into it was coming back in long, sweeping lines of fertility. The changes seemed beautiful and harmonious to me; it was like watching the growth of a great man or of a great idea. I recognized every tree and sandbank and rugged draw. I found that I remembered the conformation of the land as one remembers the modelling of human faces.”
—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)