def test_tree_with_one_value():
test = BinaryTree()
test.root = _Node(5)
expected = ['Buzz']
actual = breadth_first_traversal(fizz_buzz_tree(test).root)
assert expected == actual
def test_fizz_buzz_filled_tree(fizzy_tree):
'''
Tests old_tree node values become fizz, buzz, str(num),
and fizzbuzz in new_tree node values
'''
new_tree = fizz_buzz_tree(fizzy_tree)
assert new_tree.root.data == 'Fizz'
assert new_tree.root.left.data == 'Buzz'
assert new_tree.root.right.data == '7'
assert new_tree.root.left.left.data == 'FizzBuzz'
def test_fizz_buzz():
tree = BinaryTree()
tree.root = Node(2)
tree.root.left = Node(10)
tree.root.right = Node(15)
tree.root.left.left = Node(5)
tree.root.left.right = Node(3)
tree.root.right.right = Node(9)
tree.root.right.left = Node(4)
actual = fizz_buzz_tree(tree)
expect = [2, 'Buzz', 'Buzz', 'Fizz', 'FizzBuzz', 4, 'Fizz']
assert actual == expect
def test_fizz_buzz_tree():
bt = BinaryTree()
bt.root = _Node(2)
bt.root.left = _Node(7)
bt.root.right = _Node(5)
bt.root.left.left = _Node(2)
bt.root.left.right = _Node(6)
bt.root.right.right = _Node(9)
bt.root.right.right.left = _Node(4)
bt.root.left.right.right = _Node(11)
bt.root.left.right.left = _Node(15)
new = fizz_buzz_tree(bt)
assert breadth_first_traversal(new.root) == [
'2', '7', 'Buzz', '2', 'Fizz', 'Fizz', 'FizzBuzz', '11', '4'
]
def test_tree_with_minus():
test = BinaryTree()
test.root = _Node(-2)
test.root.left = _Node(-7)
test.root.right = _Node(-5)
test.root.left.left = _Node(-2)
test.root.left.right = _Node(-6)
test.root.right.right = _Node(-9)
test.root.right.right.left = _Node(-4)
test.root.left.right.right = _Node(-15)
test.root.left.right.left = _Node(0)
expected = [
'-2', '-7', 'Buzz', '-2', 'Fizz', 'Fizz', 'FizzBuzz', 'FizzBuzz', '-4'
]
actual = breadth_first_traversal(fizz_buzz_tree(test).root)
assert expected == actual
def test_fizz_buzz15_samevalue(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree._root.left.left.left.value == "FizzBuzz"
def test_fizz_buzz5(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree._root.right.right.value == "Buzz"
def test_fizz_buzz23(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree._root.left.left.value == "23"
def test_fizz_buzz6(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree._root.value == "Fizz"
def test_empty_tree(empty_tree):
'''Test that running fizz_buzz_tree on an empty tree returns an empty tree'''
expected = None
actual = fizz_buzz_tree(empty_tree)
assert expected == actual.root
def test_fizz_buzz10(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree.root.left.left.value == "Buzz"
def test_fizz_buzz_fizzbuzz_add_correctly(data):
assert fizz_buzz_tree(
data['tree']) == ['1', '2', '4', 'Buzz', 'Fizz', 'Fizz', 'FizzBuzz']
def test_error():
test = 'not tree'
with pytest.raises(ValueError):
fizz_buzz_tree(test)
def test_fizz_buzz2_samevalue(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree.root.left.left.left.value == "2"
def test_fizz_buzz9(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree.root.left.right.value == "Fizz"
def test_fizz_buzz7_samevalue(my_tree):
tree_test = my_tree
new_tree = fizz_buzz_tree(tree_test)
assert new_tree._root.right.right.left.value == "7"
def test_empty_tree():
tree = BinaryTree()
new_tree = fizz_buzz_tree(tree)
assert new_tree._root == None
def test_if_tree_is_empty(data):
assert fizz_buzz_tree(data['etree']) == "Tree is empty"
