next up previous contents
Next: The data structure Up: Heap implementations and variations Previous: Comparison of the Min-Max

Dynamic Heaps. A flexible priority queue

  The implicit heap as described in chapter 2 has one deficiency.- The maximum size of the heap is fixed at allocation time. The size of the heap can not be extended nor reduced dynamically without copying all data into a new heap. For many applications this is not satisfactory. Fortunately there is a simple solution to this problem.





Jesper Bojesen
Sat Apr 3 18:07:59 METDST 1999