def test_ArrayQueue():
s = ArrayQueue()
print(s.empty())
for i in range(33):
s.enqueue(i)
print('loop', i)
print(s.front())
s.print()
def print_tree(self):
q = ArrayQueue()
q.enqueue(self.root)
while not q.empty():
n = q.dequeue()
print('[k: ' + str(n.key) + ', v: ' + str(n.value) + ']')
if n.left is not None:
q.enqueue(n.left)
if n.right is not None:
q.enqueue(n.right)
#!/usr/local/bin/python3
"""
# Tests for queue implementation using an underlying fixed-size array
"""
from ArrayQueue import ArrayQueue
if __name__ == '__main__':
q = ArrayQueue()
print("Is queue empty: ")
if q.empty():
print("yes")
else:
print("no")
print("Enqueueing 9...")
q.enqueue(9)
print("Is queue empty: ")
if q.empty():
print("yes")
else:
print("no")
print("Dequeueing... ")
print(q.dequeue())
print("Enqueueing 45, 53, and 85...")
q.enqueue(45)
q.enqueue(53)
q.enqueue(85)
print("Now dequeueing all of them...")
print(q.dequeue())
print(q.dequeue())
print(q.dequeue())
