C# | Convert Queue To array Last Updated : 11 Jul, 2025 Summarize Comments Improve Suggest changes Share 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.ToArray Method is used to copy the Queue elements to a new array. 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 object[] ToArray(); Below given are some examples to understand the implementation in a better way: Example 1: CSHARP // C# code to Convert Queue to array 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("Geeks"); myQueue.Enqueue("Geeks Classes"); myQueue.Enqueue("Noida"); myQueue.Enqueue("Data Structures"); myQueue.Enqueue("GeeksforGeeks"); // Converting the Queue into array String[] arr = myQueue.ToArray(); // Displaying the elements in array foreach(string str in arr) { Console.WriteLine(str); } } } Output: Geeks Geeks Classes Noida Data Structures GeeksforGeeks Example 2: CSHARP // C# code to Convert Queue to array 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(2); myQueue.Enqueue(3); myQueue.Enqueue(4); myQueue.Enqueue(5); myQueue.Enqueue(6); // Converting the Queue into array int[] arr = myQueue.ToArray(); // Displaying the elements in array foreach(int i in arr) { Console.WriteLine(i); } } } Output: 2 3 4 5 6 Reference: https://learn.microsoft.com/en-us/dotnet/api/system.collections.generic.queue-1.toarray?view=netframework-4.7.2 Comment More infoAdvertise with us Next Article queue::swap() in C++ STL 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 Copying the Queue elements to 1-D Array in C# Queue<T>.CopyTo(T[], Int32) Method is used to copy the Queue elements to an existing one-dimensional Array, starting at the specified array index. The elements are copied to the Array in the same order in which the enumerator iterates through the Queue and this method is an O(n) operation, whe 4 min read Queue.ToArray Method in C# This method is used to copy the Queue elements to a new array. The Queue is not modified and the order of the elements in the new array is the same as the order of the elements from the beginning of the Queue to its end. This method is an O(n) operation and comes under Syntax: public virtual object[ 2 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 Queue.CopyTo() Method in C# This method is used to copy the Queue elements to an existing one-dimensional Array, starting at the specified array index. The elements are copied to the Array in the same order in which the enumerator iterates through the Queue and this method is an O(n) operation, where n is Count. This method co 4 min read queue::swap() in C++ STL Queue is also an abstract data type or a linear data structure, which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). In a FIFO data structure, the first element added to the queue will be the first one to be removed. queue::swap() swap() fun 2 min read queue push() and pop() in C++ STL The std::queue::push() and std::queue::pop() functions in C++ STL are used to push the element at the back of the queue and remove the element from the front of the queue respectively. They are the member functions of the std::queue container defined inside the <queue> header file.In this arti 2 min read Like