Learning Outcome
Evaluate data structures in a given problem domain.
Implement standard ADTs using both primitive language and library resources.
Synthesize appropriate algorithms and dat
A queue is a special kind of list, where items are inserted at one end (the rear) and deleted at the other end (the front). We shall use the following operations on queues.
Enqueue(X): Inserts
