优先队列是0个或多个元素的集合,每个元素都有一个优先权或值,对优先队列执行的操作有1) 查找 2) 插入一个新元素 3) 删除.在最小优先队列(min priorityq u e u e)中,查找操作用来搜索优先权最小的元素,删除操作用来删除该元素 对于最大优先队列(max priority queue),查找操作用来搜索优先权最大的元素,删除操作用来删除该元素.优先权队列中的元素可以有相同的优先权,查找与删除操作可根据任意优先权进行. -Priority queue is 0 or more elements of the set, each element has a priority or value, on the implementation of priority queue operations are 1) search　2) insert a new element　3) Delete. At a minimum priority queue ( min priorityq ueue), the search operation to search for the smallest element of priority, the delete operation to remove the element　to the maximum priority queue (max priority queue), the largest search operation to search the priority elements of the delete operation to Remove the element. priority queue elements can have the same priority, search and delete operation can be carried out according to any priority.