A data structure that follows the Last-In-First-Out (LIFO) principle. The most recently added element is the first one to be removed.
A data structure that follows the First-In-First-Out (FIFO) principle. The element that has been in the queue the longest is the first one to be removed.
1. Push (adds an element to the top)
2. Pop (removes the top element)
3. Peek (returns the top element without removing it)
1. Enqueue (adds an element to the end)
2. Dequeue (removes the first element)
3. Front (returns the first element without removing it)
4. Rear (returns the last element without removing it)
1. Managing function calls and recursive algorithms
2. Evaluating arithmetic expressions
3. Undo/Redo operations in editors
1. Process scheduling and task management
2. Print spooling and buffer management
3. Handling requests in a web server
1. Can be implemented using a list or an array.
2. Alternatively, a stack can be implemented using a linked list.
1. Can be implemented using a list or an array.
2. Alternatively, a queue can be implemented using a linked list.