C# | Create a Queue from another collection
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 deque. Queue
- 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.
public T ToArray ();
Here T is a new array containing elements copied from the Queue
Below given are some examples to understand the implementation in a better way :
Total number of elements in the Queue 1 are : 5 GeeksforGeeks is the best website Total number of elements in the Queue 2 are : 5 GeeksforGeeks is the best website
Total number of elements in the Queue 1 are : 5 5 10 15 20 25 Total number of elements in the Queue 2 are : 5 5 10 15 20 25