We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5033d88 commit 73445bcCopy full SHA for 73445bc
Data Structures and Algorithms/queues.py
@@ -0,0 +1,27 @@
1
+class Queue:
2
+ def __init__(self):
3
+ self.queue = []
4
+
5
+ def enqueue(self, item):
6
+ self.queue.append(item)
7
8
+ def dequeue(self):
9
+ if not self.is_empty():
10
+ return self.queue.pop(0)
11
+ return "Queue is empty"
12
13
+ def is_empty(self):
14
+ return len(self.queue) == 0
15
16
+ def peek(self):
17
+ return self.queue[0] if not self.is_empty() else None
18
19
+ def size(self):
20
+ return len(self.queue)
21
22
+# Example Usage
23
+q = Queue()
24
+q.enqueue(10)
25
+q.enqueue(20)
26
+print(q.dequeue()) # Output: 10
27
+print(q.peek()) # Output: 20
0 commit comments