Data Structures and Algorithms Lecture Notes
14 February 2011
•
Queues
“
Messes with
”
may be too strong. It
’
s possible to consider regular queues as a special case of priority queues in which the values are timestamped with their entry times and maintained in ascending order.
This page last modified on 2006 January 24.