def test_two_values_no_fizz():
tree = BinaryTree()
tree.root = Node(4)
tree.root.left = Node(23)
assert fizz_buzz_tree(tree).root.value == '4'
assert fizz_buzz_tree(tree).root.left.value == '23'
def test_fizz_buzz_function(ten_tree):
fizz_buzz_tree(ten_tree)
assert ten_tree.root.value == "Buzz"
assert ten_tree.root.left.left.value == "Fizz"
assert ten_tree.root.right.right.left.value == "16"
assert ten_tree.root.right.right.right.value == "101"
assert ten_tree.root.right.right.right.right.value == "FizzBuzz"
def test_fizz_buzz_function(ten_tree):
fizz_buzz_tree(ten_tree)
assert ten_tree.root.value == 'Buzz'
assert ten_tree.root.left.left.value == 'Fizz'
assert ten_tree.root.right.right.left.value == '16'
assert ten_tree.root.right.right.right.value == '101'
assert ten_tree.root.right.right.right.right.value == 'FizzBuzz'
def test_single_node_before_and_after(bst_empty):
""" tests fizzbuzz tree function on empty and single node tree"""
assert bst_empty.root is None
bst_empty.insert(9)
bst_empty.insert(5)
fizz_buzz_tree(bst_empty)
assert bst_empty.root.left.val == 'buzz'
def test_fbt_valid_output(bst_ten_values_random):
"""
tests fizzbuzz tree on valid tree with fizz, buzz, fizzbuzz,
and none cases """
check_list = []
# bst_ten_values_random.in_order_trav(lambda x: print(x))
fizz_buzz_tree(bst_ten_values_random)
bst_ten_values_random.in_order_trav(lambda x: check_list.append(x.val))
assert check_list == [1, 2, 'buzz', 'buzz', 'fizz', 7, 'fizz', 'fizzbuzz']
def test_three_values_no_fizz():
tree = BinaryTree()
tree.root = Node(4)
tree.root.left = Node(23)
tree.root.right = Node(19)
assert fizz_buzz_tree(tree).root.value == '4'
assert fizz_buzz_tree(tree).root.left.value == '23'
assert fizz_buzz_tree(tree).root.right.value == '19'
def test_fizz_buzz():
tree = BinaryTree()
tree.root = Node(17)
tree.root.left = Node(15)
tree.root.right = Node(5)
tree.root.right.left = Node(9)
assert fizz_buzz_tree(tree).root.value == '17'
assert fizz_buzz_tree(tree).root.left.value == 'FizzBuzz'
assert fizz_buzz_tree(tree).root.right.value == 'Buzz'
assert fizz_buzz_tree(tree).root.right.left.value == 'Fizz'
def test_fizz_buzz_empty():
tree = BinaryTree()
tree = fizz_buzz_tree(tree)
actual = isinstance(tree, BinaryTree)
expected = True
assert actual == expected
def test_fizz_buzz_tree_none():
tree = BinaryTree()
node = Node(49)
tree.root = node
node = Node(23)
tree.root.left = node
node = Node(61)
tree.root.right = node
node = Node(31)
tree.root.left.right = node
fizz_buzz_tree(tree)
arr = tree.returnAsArr(TraverseMethod.IN_ORDER)
actual = f'{arr}'
expected = "[23, 31, 49, 61]"
assert actual == expected
def test_fizz_buzz_imbalanced_tree():
tree = BinaryTree()
tree.add(10)
tree.add(15)
tree.add(20)
tree.add(22)
tree.add(91)
tree.add(3000)
tree = fizz_buzz_tree(tree)
assert tree.root.value == 'Buzz'
assert tree.root.right.right.right.right.right.value == 'FizzBuzz'
def test_fizz_buzz_tree_all():
tree = BinaryTree()
node = Node(50)
tree.root = node
node = Node(25)
tree.root.left = node
node = Node(60)
tree.root.right = node
node = Node(30)
tree.root.left.right = node
fizz_buzz_tree(tree)
arr = tree.returnAsArr(TraverseMethod.IN_ORDER)
actual = f'{arr}'
expected = "['Buzz', 'FizzBuzz', 'Buzz', 'FizzBuzz']"
assert actual == expected
def test_fizz_buzz_empty_tree():
tree = BinaryTree()
assert fizz_buzz_tree(tree) == "Empty Tree"
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_buzz10(test_tree):
new_tree = fizz_buzz_tree(test_tree)
assert new_tree.root.right.right.left.value == "Buzz"
def test_func_exists():
fizz_buzz_tree(None)
def test_fizz_buzz_15(test_tree):
new_tree = fizz_buzz_tree(test_tree)
assert new_tree.root.right.value == "FizzBuzz"
def test_fizz_buzz21(test_tree):
new_tree = fizz_buzz_tree(test_tree)
assert new_tree.root.left.left.value == "Fizz"
def test_fizz_buzz(test_tree):
new_tree = fizz_buzz_tree(test_tree)
assert new_tree.root.value == "Buzz"
def test_no_fizz_buzz(test_tree):
new_tree = fizz_buzz_tree(test_tree)
assert new_tree.root.left.value == "1"
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_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_if_root_is_none(tree):
actual = fizz_buzz_tree(tree)
expected = 'root is None'
assert actual == expected
def test_fizz_buzz_tree(value_tree):
fizz_buzz_tree(value_tree)
assert value_tree.root.value == 9
assert value_tree.root.left.left.value == 2
assert value_tree.root.right.left.value == 12
assert value_tree.root.right.right.right.value == 45
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_fbt_empty_bst(bst_empty):
""" tests fizzbuzztree function on empty tree"""
check_list = []
fizz_buzz_tree(bst_empty)
bst_empty.in_order_trav(lambda x: check_list.append(x.val))
assert check_list == []
def test_one_to_15():
one = Node(1)
two = Node(2)
three = Node(3)
four = Node(4)
five = Node(5)
six = Node(6)
seven = Node(7)
eight = Node(8)
nine = Node(9)
ten = Node(10)
eleven = Node(11)
twelve = Node(12)
thirteen = Node(13)
fourteen = Node(14)
fifteen = Node(15)
"""
1
2 3
4 5 6 7 8 9
10 11 12 13 14 15
"""
one.children = [two, three]
two.children = [four, five, six]
three.children = [seven, eight, nine]
four.children = [ten]
five.children = [eleven]
six.children = [twelve]
seven.children = [thirteen]
nine.children = [fourteen, fifteen]
kt = KaryTree()
kt.root = one
fizzy_tree = fizz_buzz_tree(kt)
actual = fizzy_tree.breadth_first()
expected = [
"1",
"2",
"Fizz",
"4",
"Buzz",
"Fizz",
"7",
"8",
"Fizz",
"Buzz",
"11",
"Fizz",
"13",
"14",
"FizzBuzz",
]
assert actual == expected
assert kt.breadth_first() == [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
]
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"
