Ch06-优先队列.pptVIP

优先队列 高文宇 gwyy@163.com §1 预备知识 Priority queue is a data structure which allows at least two operations insert deleteMin: finds, returns and removes the minimum elements in the priority queue 优先队列的ADT 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 ); 二叉堆 定义1（完全二叉树）：A binary tree with n nodes and height h is complete iff its nodes correspond to the nodes numbered from 1 to n in the p