Queue

QUEUE
• Queue implements a First In First Out - FIFO mechanism
• Element inserted at the back (enqueue) and removed from the front (dequeue)
• Declared as: Queue numbers = new Queue(10);
• Adding a member: numbers.Enqueue(10);
• Deleting a member: numbers.Dequeue
• Return the item from front: Peek
• Clear all items from Queue: Clear
• Find an item in Queue: Contains