'Buildpq l' presentation slideshows

CS 330: Algorithms Priority Queues

CS 330: Algorithms Priority Queues. Gene Itkis. Priority Queue (PQ). Definition (access methods) Insert(x) Inserts element x into the PQ RemoveMin() ? y Returns the smallest element y in PQ (from all inserted and not yet removed) Empty() Returns TRUE if PQ is empty, FALSE otherwise

261 views • 13 slides