def test_max_val_same_el():
tree = BinaryTree(1)
tree.root.left = Node(-3)
tree.root.left.left = Node(-3)
tree.root.left.left.left = Node(-3)
tree.root.left.left.left.left = Node(-3)
assert tree.find_maximum_value() == 1
def test_max_val():
tree = BinaryTree(2)
tree.root = Node(-1)
tree.root.left = Node(4)
tree.root.left.left = Node(7)
tree.root.left.left.left = Node(3)
tree.root.left.left.left.left = Node(8)
assert tree.find_maximum_value() == 8
def test_three_node_neg_num_max():
one = Node(-3)
one.left = Node(-4)
one.right = Node(-1)
tree = BinaryTree(one)
actual = tree.find_maximum_value(tree.root)
expected = -1
assert actual == expected
def test_three_node_same_BT_max():
one = Node(3)
one.left = Node(3)
one.right = Node(3)
tree = BinaryTree(one)
actual = tree.find_maximum_value(tree.root)
expected = 3
assert actual == expected
def test_edge_negative_maxiumum():
tree = BinaryTree()
Node1 = Node(-7)
Node2 = Node(-8)
Node3 = Node(-78)
Node1.left = Node2
Node1.right = Node3
tree.root = Node1
actual = tree.find_maximum_value()
expected = -7
assert actual == expected
def test_happy_maximum():
tree = BinaryTree()
Node1 = Node(7)
Node2 = Node(8)
Node3 = Node(788)
Node1.left = Node2
Node1.right = Node3
tree.root = Node1
actual = tree.find_maximum_value()
expected = 788
assert actual == expected
def test_find_max():
tree = BinaryTree()
tree.add(10)
tree.add(5)
tree.add(15)
tree.add(7)
tree.add(3)
tree.add(12)
tree.add(6)
tree.add(18)
expected = [10, 5, 15, 3, 7, 12, 18, 6]
actual = BinaryTree.find_maximum_value(tree)
assert expected == actual
def test_one_node_max():
three = Node(3)
tree = BinaryTree(three)
actual = tree.find_maximum_value(tree.root)
expected = 3
assert actual == expected
def test_empty_BT_max():
tree = BinaryTree()
actual = tree.find_maximum_value(tree.root)
expected = 'your tree is empty'
assert actual == expected
def test_empty_maximum():
tree = BinaryTree()
actual = tree.find_maximum_value()
expected = "I pitty the empty fool!"
assert actual == expected
def test_max_val_one_el():
tree = BinaryTree(7)
assert tree.find_maximum_value() == 7
