C# | Remove all objects from the Queue Last Updated : 11 Jul, 2025 Comments Improve Suggest changes Like Article Like Report 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. Clear Method is used to remove the objects from the Queue. This method is an O(n) operation, where n is total count of elements. 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 : public virtual void Clear(); Below given are some examples to understand the implementation in a better way: Example 1: CSHARP // C# code to Remove all // objects from the Queue using System; using System.Collections.Generic; class GFG { // Driver code public static void Main() { // Creating a Queue of strings Queue<string> myQueue = new Queue<string>(); // Inserting the elements into the Queue myQueue.Enqueue("1st Element"); myQueue.Enqueue("2nd Element"); myQueue.Enqueue("3rd Element"); myQueue.Enqueue("4th Element"); myQueue.Enqueue("5th Element"); myQueue.Enqueue("6th Element"); // Displaying the count of elements // contained in the Queue before // removing all the elements Console.Write("Total number of elements in the Queue are : "); Console.WriteLine(myQueue.Count); // Removing all elements from Queue myQueue.Clear(); // Displaying the count of elements // contained in the Queue after // removing all the elements Console.Write("Total number of elements in the Queue are : "); Console.WriteLine(myQueue.Count); } } Output: Total number of elements in the Queue are : 6 Total number of elements in the Queue are : 0 Example 2: CSHARP // C# code to Remove all // objects from the Queue using System; using System.Collections.Generic; class GFG { // Driver code public static void Main() { // Creating a Queue of Integers Queue<int> myQueue = new Queue<int>(); // Inserting the elements into the Queue myQueue.Enqueue(3); myQueue.Enqueue(5); myQueue.Enqueue(7); myQueue.Enqueue(9); myQueue.Enqueue(11); // Displaying the count of elements // contained in the Queue before // removing all the elements Console.Write("Total number of elements in the Queue are : "); Console.WriteLine(myQueue.Count); // Removing all elements from Queue myQueue.Clear(); // Displaying the count of elements // contained in the Queue after // removing all the elements Console.Write("Total number of elements in the Queue are : "); Console.WriteLine(myQueue.Count); } } Output: Total number of elements in the Queue are : 5 Total number of elements in the Queue are : 0 Reference: https://learn.microsoft.com/en-us/dotnet/api/system.collections.generic.queue-1.clear?view=netframework-4.7.2 Comment More infoAdvertise with us Next Article Getting an object at the beginning of the Queue in C# S Sahil_Bansall Follow Improve Article Tags : Misc C# CSharp-method CSharp-Generic-Queue CSharp-Collections-Namespace CSharp-Generic-Namespace +2 More Practice Tags : Misc Similar Reads C# | Remove all objects from the Stack Stack represents a last-in, first out collection of object. It is used when you need a last-in, first-out access to items. When you add an item in the list, it is called pushing the item and when you remove it, it is called popping the item. Stack<T>.Clear Method is used to Removes all objects 3 min read Queue remove() method in Java The remove() method of Queue Interface returns and removes the element at the front of the container. It deletes the head of the container. The method throws an NoSuchElementException when the Queue is empty. Syntax: E remove() Returns: This method returns the head of the Queue. Exception: The funct 3 min read queue::front() and queue::back() in C++ STL Queue are a type of container adaptors which operate in a first in first out (FIFO) type of arrangement. Elements are inserted at the back (end) and are deleted from the front. queue::front() This function is used to reference the first or the oldest element of the queue container. This function can 3 min read Getting an object at the beginning of the Queue in C# The Dequeue() method is used to returns the object at the beginning of the Queue. This method is similar to the Peek() Method. The only difference between Dequeue and Peek method is that Peek() method will not modify the Queue but Dequeue will modify. This method is an O(1) operation and comes under 2 min read PriorityQueue remove() Method in Java The remove() method of PriorityQueue class of java.util package is used to remove a particular element from a PriorityQueue. As we all know that the elements while entering into the priority queue are not sorted but as we all know while taking out elements from the priority queue the elements are al 5 min read C# | Convert Queue To array 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.ToArray Method is used to copy the Queue elements to a new array 2 min read Like