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 virtual object ToArray();
Below given are some examples to understand the implementation in a better way:
Geeks Geeks Classes Noida Data Structures GeeksforGeeks
2 3 4 5 6
- Copying the Queue elements to 1-D Array in C#
- C# | Convert Stack to array
- C# | How to convert an ArrayList to Array
- Program to convert Byte array to IP Address
- Queue.Contains() Method in C#
- C# Queue with Examples
- C# | Queue Class
- How to create a Queue in C#
- C# | Check if an element is in the Queue
- C# | Create a Queue from another collection
- C# | Remove all objects from the Queue
- Getting an object at the beginning of the Queue in C#
- Getting enumerator that iterates through the Queue in C#
- Queue.Equals() Method in C#
- Queue.ToArray Method in C#
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.