Definition: Variants of heapsort.
Generalization (I am a kind of ...)
Aggregate child (... is a part of or used in me.)
balanced binary search tree, heap.
See also treesort (1).
Note: The algorithms Floyd named treesort can be seen as developments leading to what we now call heapsort.
Robert W. Floyd, Algorithm 245 Treesort 3, CACM, 7(12):701, December 1964.
Robert W. Floyd, Algorithm 113 Treesort, CACM, 5(8):434, August 1962.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 14 August 2008.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "treesort (2)", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 14 August 2008. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/treesort2.html