Stack represents a last-in, first out collection of object. It is used when you need a last-in, first-out access of 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>.ToArray Method is used to copy a Stack<T> to a new array.
- The capacity of a Stack is the number of elements the Stack can hold. As elements are added to a Stack, the capacity is automatically increased as required through reallocation.
- If Count is less than the capacity of the stack, Push is an O(1) operation. If the capacity needs to be increased to accommodate the new element, Push becomes an O(n) operation, where n is Count. Pop is an O(1) operation.
- Stack accepts null as a valid value and allows duplicate elements.
public T ToArray ();
Return Type: This method returns a new array t which contains the copy of the elements of the Stack<T>.
Below given are some examples to understand the implementation in a better way :
GeeksforGeeks Data Structures Noida Geeks Classes Geeks
6 5 4 3 2
- C# | Copy the Stack to an Array
- C# | Convert Queue To array
- C# | How to convert an ArrayList to Array
- Convert String to Character Array in C#
- How to Convert Integer Array to List in C#?
- Different Ways to Convert Char Array to String in C#
- Program to convert Byte array to IP Address
- Stack.Pop() Method in C#
- Stack.Contains() Method in C#
- C# | How to create a Stack
- C# Stack with Examples
- Implementing Stack in C#
- C# | Stack Class
- Stack.Peek Method in C#
- How to get Synchronize access to the Stack in C#
- Getting an enumerator that iterates through the Stack in C#
- Stack.Synchronized() Method in C#
- Removing the object from the top of the Stack in C#
- Stack.Equals() Method in C#
- Stack.Clone() Method in C#
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.