def test_dequeue():
q = Queue(3)
for val in range(1, 4):
q.enqueue(val)
index_head = index_tail = -1
assert q.is_full()
assert q.dequeue()
assert q.dequeue()
assert q.dequeue()
assert q.is_empty()
assert q.head == index_head
assert q.tail == index_tail
def test_work():
q = Queue(3)
assert q.enqueue(7)
assert q.dequeue()
assert q.front() == -1
assert not q.dequeue()
assert q.front() == -1
assert q.rear() == -1
assert q.enqueue(0)
assert not q.is_full()
assert q.dequeue()
assert q.enqueue(3)
assert q.enqueue(4)
assert q.enqueue(5)
assert q.is_full()
assert q.front() == 3
assert q.rear() == 5
def test_enqueue_dequeue():
q = Queue(3)
for val in range(1, 4):
q.enqueue(val)
assert q.front() == 1
assert q.rear() == 3
assert q.dequeue()
assert q.front() == 2
assert q.rear() == 3
assert q.dequeue()
assert q.front() == 3
assert q.enqueue(10)
assert q.rear() == 10
def level_traversal(self, root):
q = Queue()
visited = []
q.enqueue(root)
while not q.is_empty():
node = q.dequeue()
visited.append(node.value)
if node.left:
q.enqueue(node.left)
if node.right:
q.enqueue(node.right)
return visited
from queue_ import Element, LinkedList, Queue
el1 = Element("Apple")
el2 = Element("Pear")
el3 = Element("Peach")
q = Queue()
q.enqueue(el1)
q.enqueue(el2)
print(q.ll.toArray())
q.dequeue()
q.dequeue()
q.dequeue()
print(q.ll.toArray())
q.enqueue(el1)
q.enqueue(el2)
q.enqueue(el3)
print(q.ll.toArray())