A stack in Data structure is a LIFO structure. Last In First
Out. Think of it as a stack of books or a stack of trays in a
cafeteria line. when you are in a line in a cafeteria you take the
tray that is on the top and the worker place new washed ones also
on the top. So deletion and insertion all done at one end, it is
called the top of the stack. In Computer Programming Stacks are so
important and have too many applications such as the evaluation of
Mathematical expressions. Also note that a stack is unlike a queue
structure. Queue data structure is FIFO. First In First Out as in a
bank teller line.