Advanced Programming I Lecture Notes

Advanced Programming I Lecture Notes

23 February 2006 • Queues


"Messes with" may be too strong. It's possible to consider regular queues as a special case of priority queues in which the elements are timestamped with their entry times and maintained in ascending order.


This page last modified on 24 January 2006.