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>.Peek Method is used to returns the object at the top of the Stack<T> without removing it. This method is an O(1) operation.
- 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.
Return Value: The Peek() method returns the last (top-most) value from the Stack<T> of type System.Object.
Exception: Calling Peek() method on empty stack will throw InvalidOperationException. So always check for elements in the stack before retrieving elements using the Peek() method.
Below given are some examples to understand the implementation in a better way.
Total number of elements in the Stack are : 6 Element at the top is : 6th Element Element at the top is : 6th Element Total number of elements in the Stack are : 6
System.InvalidOperationException: Stack empty.
- C# | Get the object at the beginning of the Queue - Peek Operation
- C# | Insert an object at the top of the Stack - Push Operation
- Stack.Peek Method in C#
- Removing the object from the top of the Stack in C#
- Queue.Peek Method in C#
- C# | Add an object to the end of the Queue - Enqueue Operation
- C# | Get the number of elements contained in the Stack
- How to get Synchronize access to the Stack in C#
- C# | Check if an array object is equal to another array object
- C# | Get an IDictionaryEnumerator object in OrderedDictionary
- C# | Bitwise OR operation between the elements of BitArray
- C# | Bitwise exclusive OR operation between the elements of BitArray
- Implementing Stack in C#
- C# | .NET Framework (Basic Architecture and Component Stack)
- C# | Create a Stack from a collection
- C# | Check if a Stack contains an element
- C# | Remove all objects from the Stack
- C# | Convert Stack to array
- C# | Copy the Stack to an Array
- C# | Stack<T>.TrimExcess Method with Examples
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.