Queue represents a
first-in, first out collection of object. It is used when you need a first-in, first-out access of items. When you add an item in the list, it is called
enqueue, and when you remove an item, it is called
dequeue.
Queue<T>.Enqueue(T) Method is used to add an object to the end of the Queue<T>.
Properties:
- Enqueue adds an element to the end of the Queue.
- Dequeue removes the oldest element from the start of the Queue.
- Peek returns the oldest element that is at the start of the Queue but does not remove it from the Queue.
- The capacity of a Queue is the number of elements the Queue can hold.
- As elements are added to a Queue, the capacity is automatically increased as required by reallocating the internal array.
- Queue accepts null as a valid value for reference types and allows duplicate elements.
Syntax :
void Enqueue(object obj);
The Enqueue() method inserts values at the end of the Queue.
Example:
Output:
Total number of elements in the Queue are : 1
Total number of elements in the Queue are : 2
Total number of elements in the Queue are : 3
Total number of elements in the Queue are : 4
Total number of elements in the Queue are : 5
Total number of elements in the Queue are : 6
Reference:
