Update Stack.md

Author: coder9051

Stack.md

@@ -1,5 +1,24 @@
 # Stack
 
-A stack is a linear data structure. It follows the last in first out approach. A new item is added at the top of a stack. Both insert and deletion operation is performed from one end of the stack.
+A stack is a linear data structure that follows the principle of Last In First Out (LIFO). This means the last element inserted inside the stack is removed first.
+
+In stacks, the insertion and deletion of elements happen only at one endpoint of it.
+
+## How to understand stack practically
+You can think of the stack data structure as the pile of plates on top of another.
+
+Here, you can:
+
+* Put a new plate on top
+* Remove the top plate
+
+And, if you want the plate at the bottom, you must first remove all the plates on top. This is exactly how the stack data structure works.
+
+## Methods to implement Stack in C
+* **Statically**: Array implementation of stacks allows the static memory allocation of its data elements. It is important to note that in this method, the stack acquires all the features of an array.
+* **Dynamically**: Linked list implementation of stacks follow the dynamic memory allocation of its data elements. It is important to note that in this method, the stack inherits all the characteristics of a linked list in C.
+
+## Operations performed on stack
+
+### Push : Adding an element onto the stack
 
-There are two functions associated with stacks. Push function to add elements to the stack and pop function to remove elements from the stack.