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 4190d16 commit fb15c02Copy full SHA for fb15c02
Queue/CicularQueue.py
@@ -24,7 +24,7 @@ def isEmpty(self):
24
def isFull(self):
25
return (self.rear + 1) % self.limit == self.front
26
27
- # for adding an element at the rear end
+ # for adding an element to the queue
28
def enqueue(self, data):
29
if self.isFull():
30
print('Queue is Full!')
@@ -36,7 +36,7 @@ def enqueue(self, data):
36
self.rear = (self.rear + 1) % self.limit
37
self.queue[self.rear] = data
38
39
- # for deleting the deleting an element from front end
+ # for removing an element from the queue
40
def dequeue(self):
41
if self.isEmpty():
42
print('Queue is Empty!')
0 commit comments