Thanks to visit codestin.com
Credit goes to github.com

Skip to content
This repository was archived by the owner on Sep 7, 2025. It is now read-only.
Open
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
commit on haktoberfest_contri
  • Loading branch information
ItsAdityaKSingh committed Oct 4, 2021
commit a710fe2131a655c4e595d18c4154dab825c1067c
39 changes: 39 additions & 0 deletions algorithms/data-structures/queues/queues.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
# Queue implementation in Python

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)

# For general working of a queue in python:
# q = Queue()
# q.enqueue(1)
# q.enqueue(2)
# q.enqueue(3)
# q.enqueue(4)
# q.enqueue(5)

# q.display()

# q.dequeue()

# print("After removing an element")
# q.display()