chap07_01 Priority(Heaps).pptVIP

*/8 数据结构(Data Structures)(C语言版) 主讲教师： 吴让仲 Instructor: WU, RANGZHONG E-mail: wurangzhong@163.com 中国地质大学(武汉)机电学院通信系 2012年秋季 CHAPTER 7 PRIORITY QUEUES优先队列 (HEAPS堆) §1 ADT Model Objects: A finite ordered list with zero or more elements. Operations: ? PriorityQueue Initialize( int MaxElements ); ? void Insert( ElementType X, PriorityQueue H ); ? ElementType DeleteMin( PriorityQueue H ); ? ElementType FindMin( PriorityQueue H ); —— delete the element with the highest \ lowest priority §2 Simple Implementations ? Array : Insertion — add one item at the end ~ ? ( 1 ) Deletion