Stack

Author: Shikha-code36

README.md

@@ -36,5 +36,7 @@ You can implement these notes in your own favourite programming language.
     - [x] [KMP (Knuth Morris Pratt) Pattern Searching](Strings/KMP.py)
 - [x] [Trees](Trees)
     - [x] [Binary Search Tree](Trees/binarysearchtree.py)
+- [x] [Stack And Queue](Trees)
+    - [x] [Stack](Stack-and-Queue/stack.py)
 
 This repository is for the references, anyone can feel free to use this.

Stack-and-Queue/stack.py

@@ -0,0 +1,49 @@
+'''
+                                    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.
+'''
+
+# Stack implementation in python
+
+
+# Creating a stack
+def create_stack():
+    stack = []
+    return stack
+
+
+# Creating an empty stack
+def check_empty(stack):
+    return len(stack) == 0
+
+
+# Adding items into the stack
+def push(stack, item):
+    stack.append(item)
+    print("pushed: " + item)
+
+
+# Removing an element from the stack
+def pop(stack):
+    if (check_empty(stack)):
+        return "stack is empty"
+
+    return stack.pop()
+
+
+stack = create_stack()
+push(stack, str(1))
+push(stack, str(2))
+push(stack, str(3))
+push(stack, str(4))
+print("popped: " + pop(stack))
+print("After popping: " + str(stack))
+
+'''
+pushed: 1
+pushed: 2
+pushed: 3
+pushed: 4
+popped: 4
+After popping: ['1', '2', '3']
+'''