I am a software engineer. I have been working with C++, MFC, and net technologies for 15 years. I like video games and reading books.
1. Stack and Queue
Stack and Queue both are collection classes supported by the dot net framework. Queue operates on the “First in First Out (FIFO)” principle. Stack operates on the “Last in First out (LIFO)” principle. That is, when you remove an item from the Queue, the first added item will be removed first. In the case of the stack, it is in the reverse order, which means the item added last is removed first.
To use Stack and Queue on your application first, include the namespace “System.Collection”.
2. Using C# Queue Class
We use the Queue and stack both in our Static Main method. First, let us go with Queue.
1) First, we create a Queue and store 5 integers in it. Then we use Queue class’s Enqueue() function to add an element at the back of the Q. In our example, both Queue and stack will be placed Static Main method. First, let us go with Queue.
2) We write a function to display all the elements in the Queue. The function takes the IEnumerable interface as a parameter. This means the function expects an object which implements the IEnumerable interface. Then, the function walks through the collection object and displays each element in it.
Read More From Owlcation
3) The Peek() method will return the first item in the Queue. That is; it will get the element first added (One that is there in the Front). However, Peek() method will not remove the item from the Queue. But, the Dequeue() will take the item from the front and removes it. The usage of Peek() and Dequeue() is shown in the below Code:
Output of executing the above is given here below:
3. Using C# Stack Class
The code we see below is copied and pasted from Queue and changed for Stack. When we add an element using the push function, it will be added to the top. When you remove an item using pop, it will be removed from the top of the Stack. Hence, the item added last will be removed first. The below code shows the usage of Stack:
Output of executing the Stack Example is shown below: