Queue

Author: Shikha-code36

README.md

@@ -38,5 +38,6 @@ You can implement these notes in your own favourite programming language.
     - [x] [Binary Search Tree](Trees/binarysearchtree.py)
 - [x] [Stack And Queue](Trees)
     - [x] [Stack](Stack-and-Queue/stack.py)
+    - [x] [Queue](Stack-and-Queue/queue.py)
 
 This repository is for the references, anyone can feel free to use this.

Stack-and-Queue/queue.py

@@ -0,0 +1,46 @@
+'''
+                                    Queue
+Queue follows the First In First Out (FIFO) rule - the item that goes in first is the item that comes out first.
+'''
+
+class Queue:
+
+    def __init__(self):
+        self.queue = []
+
+    # Add an element
+    def enqueue(self, item):
+        self.queue.append(item)
+
+    # Remove an element
+    def dequeue(self):
+        if len(self.queue) < 1:
+            return None
+        return self.queue.pop(0)
+
+    # Display  the queue
+    def display(self):
+        print(self.queue)
+
+    def size(self):
+        return len(self.queue)
+
+
+q = Queue()
+q.enqueue(1)
+q.enqueue(2)
+q.enqueue(3)
+q.enqueue(4)
+q.enqueue(5)
+
+q.display()
+
+q.dequeue()
+
+print("After removing:")
+q.display()
+'''
+[1, 2, 3, 4, 5]
+After removing:
+[2, 3, 4, 5]
+'''