A bounded priority queue is one which has a maximum number of elements, say n. If the priority already has n elements, and a new element is added, then the element with lowest priority is removed from ...

Add a description, image, and links to the bounded-queue topic page so that developers can more easily learn about it.