data_structures/queue&classes.py at main · njange/data_structures · GitHub

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
import collections
q = collections.deque()
print(q)

q.appendleft(10)
q.appendleft(20)
q.appendleft(30)
print(q)

print(q.pop())

print(q.append(40))
print(q)

print(not q)

print(q[0])

print(q[-1])

import queue
q1 = queue.Queue()
q1.put(10)
q1.put(20)
q1.put(30)
print(q1)

print(q1.get())
print(q1.get())
print(q1.get())

# Priority Queue
q2 = []
q2.append(2)
q2.append(1)
q2.append(3)
print(q2)
print(q2.sort())
print(q2)

q3 = queue.PriorityQueue()
q3.put(10)
q3.put(20)
q3.put(30)
print(q3)

print(q3.get())

q4 = []
q4.append((2, "work"))
q4.append((1, "eat"))
q4.append((3, "sleep"))
print(q4)
print(q4.sort())
print(q4)
p