Explain the term stack operation

Question

Explain the term stack operation. Also write some of its operations.

Answer 1

The Stack is a data structure which follows Last in First out strategy.

Stack Operations are as follows:

Push: It pushes (inserts) the element in the stack. The location is specified through the pointer.

Pop: It pulls (eliminates) the element out of the stack. The location is specified through the pointer.

Swap:  It is the two top most elements of the stack can be swapped.

Peek: It returns the top element on the stack however doesn’t remove it from the stack.

Rotate: It is the topmost (n) items which can be moved on the stack in a rotating fashion.

The stack has a fixed location in the memory. Whenever a data element is pushed in the stack, the pointer points to the present element.