-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQueue_ex1.py
150 lines (65 loc) · 1.58 KB
/
Queue_ex1.py
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
class Node:
def __init__(self,data):
self.data = data
self.next = None
class queue:
def __init__(self):
self.front = None
self.rear = None
def enque(self,data):
newNode = Node(data)
if self.rear is None:
self.front=self.rear=newNode
return
else:
self.rear.next=newNode
self.rear=newNode
def deque(self):
if self.front is None:
print("empty queue")
return
self.front = self.front.next
if self.front is None:
self.rear = None
def display(self):
temp=self.front
if temp is None:
print("Empty")
return
while temp is not None:
print(temp.data)
temp=temp.next
newQueue = queue()
newQueue.enque(10)
newQueue.enque(20)
newQueue.enque(30)
# newQueue.deque()
newQueue.display()
# from collections import deque
# class Queue:
# def __init__(self):
# self.buffer = deque()
# def enqueue(self,val):
# self.buffer.appendleft(val)
# def dequeue(self):
# return self.buffer.pop()
# def is_empty(self):
# return len(self.buffer)==0
# def size(self):
# return len(self.buffer)
#
#
# pq = Queue()
# pq.enqueue({
# 'company':'Google',
# 'address':'Banglure',
# 'profit' :1000
# })
# pq.enqueue({
# 'company':'Google',
# 'address':'Ksrkode',
# 'profit':2000
# })
# print(pq.dequeue())
#
# # print(pq.is_empty())