Illustrates the stack operation in briefly

Question

Illustrates the stack operation in briefly?

Answer 1

Stack is a data structure which follows LIFO (Last in First out) strategy.

Stack Operations are as follows:

a. Push: It means inserts or pushes the element within the stack. The location is specified by the pointer.

b. Pop: It uses as removes or pulls the element out of the stack. This location is given through the pointer

c. Swap: The two main top elements of the stack can be swapped in this operation.

d. Peek: In this operation returns the top element upon the stack but doesn’t eliminate this from the stack

e. Rotate: The topmost (n) items can be moved upon the stack within a rotating fashion.

A stack has a fixed location within the memory. While a data element is pushed within the stack, the pointer points to the recent element.