The nature is Static and it’s referred to as static implementation of list
The nature is dynamic and it’s referred to as dynamic implementation of list
A Stack is a linear data structure in which data is inserted and deleted at one end (same end) i.e. data is stored and retrieved in a Last In First Out (LEFO) order.
Stacks are used in compilers in passing an expression by recursion; in memory management in operating system;
Queues find their use in CPU scheduling, in printer spooling, in message queuing in computer network etc.
Store = Push and Retrieve = Pop