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.
In an earlier lesson, we saw that this collection is called a priority queue. Now we will look at an efficient way of implementing it.