Question

Basic operation of stack and Queue?

Answer 1

The basic implementation of a stack is also called a LIFO (Last In First Out) to demonstrate the way it accesses data, since as we will see there are various variations of stack implementations. There are basically three operations that can be performed on stacks. They are 1) inserting an item into a stack (push).



Hope it helps plz mark as brainliest....

Answer 2

Stack is a collection of objects that works in LIFO (Last in First out) mechanism while Queue is FIFO (First in First out). This means that the object that is inserted first is removed last in a stack while an object that is inserted first is removed first in a queue.