A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.geeksforgeeks.org/c-sharp/queue-dequeue-method-in-c-sharp/ below:

Queue.Dequeue Method in C# - GeeksforGeeks

Queue.Dequeue Method in C#

Last Updated : 11 Jul, 2025

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

System.Collections

namespace.

Syntax: 
public virtual object Dequeue ();
Return value:

It returns the object which is removed from the beginning of the Queue.

Exception:

The method throws

InvalidOperationException

on calling empty queue, therefore always check that the total count of a queue is greater than zero before calling the Dequeue() method. Below programs illustrate the use of the above-discussed method:

csharp 
// C# Program to illustrate the use 
// of Queue.Dequeue Method
using System;
using System.Collections;

class GFG {

    // Main Method
    public static void Main()
    {
        Queue queue = new Queue();
        queue.Enqueue(3);
        queue.Enqueue(2);
        queue.Enqueue(1);
        queue.Enqueue("Four");

        Console.WriteLine("Number of elements in the Queue: {0}",
                                                    queue.Count);

        // Retrieveing top element of queue
        Console.WriteLine("Top element of queue is:");
        Console.WriteLine(queue.Dequeue());

        // printing the no of queue element 
        // after dequeue operation
        Console.WriteLine("Number of elements in the Queue: {0}",
                                                    queue.Count);
    }
}
Output: 
Number of elements in the Queue: 4
Top element of queue is:
3
Number of elements in the Queue: 3
csharp 
// C# Program to illustrate the use 
// of Queue.Dequeue Method
using System;
using System.Collections;

class GFG {

    // Main Method
    public static void Main()
    {
        Queue queue = new Queue();

        // Adding elements in Queue
        queue.Enqueue(2);
        queue.Enqueue("Four");

        Console.WriteLine("Number of elements in the Queue: {0}",
                                                    queue.Count);

        // Retrieveing top element of queue
        Console.WriteLine("Top element of queue is:");
        Console.WriteLine(queue.Dequeue());

        // printing the no. of queue element
        // after dequeue operation
        Console.WriteLine("Number of elements in the Queue: {0}",
                                                    queue.Count);
    }
}
Output: 
Number of elements in the Queue: 2
Top element of queue is:
2
Number of elements in the Queue: 1
Reference:

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4