第02章基本数据结构priorityqueuesheapsdictionarieshashables.pptVIP

  • 7
  • 0
  • 约1.8万字
  • 约 45页
  • 2018-12-22 发布于福建
  • 举报

第02章基本数据结构priorityqueuesheapsdictionarieshashables.ppt

第02章基本数据结构priorityqueuesheapsdictionarieshashables

Priority Queues Priority Queues Priority Queues Priority Queue ADT A priority queue stores a collection of items An item is a pair (key, element) Main methods of the Priority Queue ADT insertItem(k, o) inserts an item with key k and element o removeMin() removes the item with smallest key and returns its element Additional methods minKey() returns, but does not remove, the smallest key of an item minElement() returns, but does not remove, the element of an item with smallest key size(), isEmpty() Applications: Standby flyers Auctions Stock market Total Order Relation Keys in a priority queue c

文档评论(0)

1亿VIP精品文档

相关文档