Welcome to imalshablog.blogspot.com . In my first blog, I decided to write about the stack data structure. It is a very easy and basic data structure as well as it is a linear data structure. A stack is a list of elements in which an element may be inserted or deleted only at one end, called the top of the stack. The insertion or deletion is happened according to the LIFO principle. LIFO stands for Last-In-First-Out. Mainly, there are five basic operations have in the stack. Push -: This operation is used for inserting an element in the stack. Before happening push operation, check whether the stack is full. if the stack is full, display the error message and exit. if the stack is not full, increment top to point next empty space and inserts the next element to stack top. Push Algorithm IF top = max - 1 print overflow END IF ...