Jump to content

Tree sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Metacosm (talk | contribs) at 22:31, 16 August 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A sort algorithm that builds a binary search tree from the keys to be sorted, and then traverses the tree so that the keys come out in sorted order.