-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbasic_queue.py
More file actions
65 lines (56 loc) · 1.64 KB
/
basic_queue.py
File metadata and controls
65 lines (56 loc) · 1.64 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
from node import Node
class Queue:
def __init__(self, max_size=None):
self.head = None
self.tail = None
self.max_size = max_size
self.size = 0
def enqueue(self, value):
if self.has_space():
item_to_add = Node(value)
item_value = item_to_add.get_value()
print("{} has been added to the queue".format(item_value))
if self.is_empty():
self.head = item_to_add
self.tail = item_to_add
else:
self.tail.set_next_node(item_to_add)
self.tail = item_to_add
self.size += 1
else:
print("Sorry, no more room!")
def dequeue(self):
if not self.is_empty():
item_to_remove = self.head
item_value = item_to_remove.get_value()
print("{} has been removed from queue.".format(item_value))
if self.get_size() == 1:
self.head = None
self.tail = None
else:
self.head = self.head.get_next_node()
self.size -= 1
return item_to_remove.get_value()
else:
print("The queue is totally empty!")
def peek(self):
if self.is_empty():
print("Nothing to see here!")
else:
return self.head.get_value()
def get_size(self):
return self.size
def has_space(self):
if self.max_size == None:
return True
else:
return self.max_size > self.get_size()
def is_empty(self):
return self.size == 0
# Testing out Queue
bts_members = Queue()
members = ["Bang PD", "Yoongi", "Taehyung", "Namjoon", "Jungkook", "Hoseok", "Jin", "Jimin"]
print("Adding members to BTS...\n------------")
for member in members:
bts_members.enqueue(member)
bts_members.dequeue()