-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueuesLinked.py
More file actions
79 lines (69 loc) · 1.66 KB
/
QueuesLinked.py
File metadata and controls
79 lines (69 loc) · 1.66 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
class _Node:
__slots__ = '_element', '_next'
def __init__(self, element, next):
self._element = element
self._next = next
class QueuesLinked:
def __init__(self):
self._front = None
self._rear = None
self._size = 0
def __len__(self):
return self._size
def isempty(self):
return self._size == 0
def enqueue(self, e):
newest = _Node(e, None)
if self.isempty():
self._front = newest
else:
self._rear._next = newest
self._rear = newest
self._size += 1
def dequeue(self):
if self.isempty():
print('Queue is empty')
return
e = self._front._element
self._front = self._front._next
self._size -= 1
if self.isempty():
self._rear = None
return e
def first(self):
if self.isempty():
print('Queue is empty')
return
return self._front._element
def display(self):
p = self._front
while p:
print(p._element,end=' <-- ')
p = p._next
print()
Q = QueuesLinked()
Q.enqueue(5)
Q.enqueue(3)
print('Queue:')
Q.display()
print('Queue Length:', len(Q))
ele = Q.dequeue()
print('Queue:')
Q.display()
print('Queue Length:', len(Q))
print('Removed Element:',ele)
print('Is Queue Empty:',Q.isempty())
Q.enqueue(7)
print('Queue:')
Q.display()
print('Queue Length:', len(Q))
Q.enqueue(12)
print('Queue:')
Q.display()
print('Queue Length:', len(Q))
ele = Q.dequeue()
print('Queue:')
Q.display()
print('Queue Length:', len(Q))
print('Removed Element:',ele)
print('First Element:',Q.first())