def breadthFirst(tree):
if tree.root == None:
return []
queue = Queues()
queue.enqueue(tree.root)
result = []
while not queue.isEmpty():
front = queue.dequeue()
if front.left:
queue.enqueue(front.left)
if front.right:
queue.enqueue(front.right)
result.append(front.value)
return result
def breadth_first(self):
queue = Queues()
queue.enqueue(self.root)
result = []
while not queue.isEmpty():
front = queue.dequeue()
for node in front.children:
queue.enqueue(node)
result.append(front.value)
return result
def new_queue():
new_queue = Queues()
new_queue.enqueue("a")
new_queue.enqueue("b")
new_queue.enqueue("c")
new_queue.enqueue("d")
return new_queue
def breadth_first(tree):
if tree.root is None:
return []
queue = Queues()
queue.enqueue(tree.root)
collection = []
while not queue.isEmpty():
front = queue.dequeue()
if front.left:
queue.enqueue(front.left)
if front.right:
queue.enqueue(front.right)
collection.append(front.value)
return collection
def fizz_buzz_tree(tree):
if tree.root is None:
raise Exception("Tree is empty")
queue = Queues()
queue.enqueue(tree.root)
while not queue.isEmpty():
front = queue.dequeue()
front.value = fizz_buzz_helper(front.value)
for node in front.children:
queue.enqueue(node)
return tree
def test_create_queue():
new_queue = Queues()
actual = new_queue.front
expected = None
assert actual == expected
def test_eight():
new_queue = Queues()
new_queue.enqueue("a")
assert new_queue.front.value == "a"
assert new_queue.rear.value == "a"
def test_fourteen():
new_queue = Queues()
with pytest.raises(Exception):
new_queue.dequeue()
def test_thirteen():
new_queue = Queues()
assert new_queue.front == None
assert new_queue.rear == None