Table of Contents
Problem: Given a collection of elements that carry a numeric "score", find and remove the element with the smallest [largest] score. New elements may be added at any time.
This collection is called a priority queue because,
like queues, it is used to simulate objects awaiting a service.
But instead of FIFO, the processing order is determined by the object's individual "priority" or score.