Data Structure and Algorithm Analysis06 Priority Queue：数据结构与算法analysis06优先队列.pptVIP

* 02 Priority Queues (Heaps) 6.1 Model 6.2 Simple Implementations 6.3 Binary Heap 6.4 Applications of Priority Queues 6.5 d-Heaps 6.6 Leftist Heaps 6.7 Skew Heaps 6.8 Binomial Queues 6.9 Priority Queues in the Standard Library * Priority Queues in the Standard Library The binary heap is implemented in the STL by the class template named priority_queue found in the standard header file queue. The STL implements a max-heap rather than a minheap The key member functions are: void push( const Object x ); const Object top( ) const; void pop( ); bool empty( ); void clear( ); Using a greater function object as the comparator yields a min-heap. * * Summary have seen various implementations and uses of the priority queue ADT. The standard binary heap implementation is elegant because of its simplicity and speed. It requires no links and only a constant amount of extra space, yet supports the priority queue operations efficiently. considered the additional merge operation and developed three implementations The leftist heap is a wonderful example of the power of recursion. The skew heap represents a remarkable data structure because of the lack of balance criteria. The binomial queue shows how a simple idea can be used to achieve a good time bound. have also seen several uses of priority queues, ranging from operating systems scheduling to simulation. * * As with most data structures, it is sometimes possible to add other operations, but these are extensions and not part of the basic model depicted in Figure 6.1. Priority queues have many applications besides operating systems. In Chapter 7, we will see how priority queues are used for external sorting. Priority queues are also important in the implementation of greedy algorithms, which operate by repeatedly finding a minimum; we will see specific examples in Chapters 9 and 10. In this chapter, we will see a use of priority queues in discrete event simulation. * The time to do the insertion could be as much as O(