(Latest Revision: 04/05/2004)
Heaps, Heapsort, and Priority Queues
Definition: A Heap is a complete binary tree whose nodes contain
search keys that are arranged in descending order along
every path from the root to a leaf. (The keys are elements of a
totally ordered set - laws of trichotomy and transitivity hold
true.)
Theorem: Heapification is &Theta(N) where N equals the number of
nodes in the complete keyed binary tree.
