def test_find_maximum_value2():
root = _Node(9)
root.left = _Node(16)
root.right = _Node(12)
actual = find_maximum_value(root)
expected = 16
assert actual == expected
def test_find_maximum_value1():
root = _Node(7)
root.left = _Node(7)
root.right = _Node(5)
root.left.left = _Node(2)
root.left.right = _Node(6)
root.left.right.left = _Node(5)
root.left.right.right = _Node(11)
root.right.right = _Node(9)
root.right.right.left = _Node(4)
assert find_maximum_value(root) == 11
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(-11)
test.root.left.right.left = Node(0)
expected = 0
actual = find_maximum_value(test)
assert expected == actual
def test_full_tree():
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(11)
test.root.left.right.left = Node(5)
expected = 11
actual = find_maximum_value(test)
assert expected == actual
def test_tree_with_one_value():
test = BinaryTree()
test.root = Node(5)
expected = 5
actual = find_maximum_value(test)
assert expected == actual
def test_empty_tree():
test = BinaryTree()
with pytest.raises(ValueError):
find_maximum_value(test)
def test_find_maximum_value3():
root = _Node(1)
assert find_maximum_value(root) == 1