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>.
- 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.
void Enqueue(object obj);
The Enqueue() method inserts values at the end of the Queue.
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
- C# | Get the object at the beginning of the Queue - Peek Operation
- Queue.Enqueue() Method in C#
- C# | Get object at the top of the Stack - Peek operation
- C# | Insert an object at the top of the Stack - Push Operation
- Getting an object at the beginning of the Queue in C#
- C# | Bitwise OR operation between the elements of BitArray
- C# | Check if an array object is equal to another array object
- C# | Bitwise exclusive OR operation between the elements of BitArray
- Queue.Contains() Method in C#
- C# | Queue Class
- C# Queue with Examples
- How to create a Queue in C#
- C# | Convert Queue To array
- C# | Check if an element is in the Queue
- C# | Create a Queue from another collection
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.