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.
Here, myQueue is the name of the Queue.
Return Value: This property returns the number of elements contained in the Queue.
Total number of elements in the Queue are : 6
Total number of elements in the Queue are : 0
- C# | Get the number of elements actually contained in the ArrayList
- C# | Get the number of elements contained in the Stack
- C# | Get the number of elements contained in SortedList
- C# | Get the number of nodes contained in LinkedList<T>
- C# | Number of elements contained in the BitArray
- C# | Check whether an element is contained in the ArrayList
- C# | Get the object at the beginning of the Queue - Peek Operation
- How to get Synchronize access to the Queue in C#
- Copying the Queue elements to 1-D Array in C#
- C# | Get the number of elements in the SortedSet
- C# | Get or set the number of elements that the ArrayList can contain
- C# | Get or set the number of elements in the BitArray
- C# | How to get all elements of a List that match the conditions specified by the predicate
- C# | Check if an element is in the Queue
- C# | Create a Queue from another collection
- C# | Remove all objects from the Queue
- C# | Add an object to the end of the Queue - Enqueue Operation
- C# | Convert Queue To array
- C# | Queue<T>.TrimExcess Method with Examples
- C# | Queue Class
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.