Anonymous user
Sorting algorithms/Tree sort on a linked list: Difference between revisions
Sorting algorithms/Tree sort on a linked list (view source)
Revision as of 12:09, 12 July 2018
, 5 years agoImprove task or delete it.
(Improve task or delete it.) |
|||
Line 1:
{{draft task|Sorting Algorithms}}
{{Sorting Algorithm}}
'''Please read the discussion page and NOT add to this task until the task itself is improved. (Or deleted).'''
{{Wikipedia pre 15 June 2009|pagename=Tree_sort|lang=en|oldid=295989333|timedate=15:13, 12 June 2009}}
A '''tree sort''' is a [[wp:sort algorithm|sort algorithm]] that builds a [[wp:binary search tree|binary search tree]] from the keys to be sorted, and then traverses the tree ([[wp:Tree traversal|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.
| |||