def test_add_four():
tree = BinaryTree()
tree.add('apples')
tree.add('oranges')
print(tree._root.left)
# tree.add('peaches')
# tree.add('bananas')
assert tree._root.value == 'apples'
assert tree._root.left.value == 'oranges'
def test_more():
tree = BinaryTree()
tree.add(22)
tree.add(5)
tree.add(3)
tree.add(11)
tree.add(2)
tree.add(13)
actual = tree.in_order()
expected = 5
assert actual == expected
def test_max_value():
bt = BinaryTree()
bt.add(4)
bt.add(2)
bt.add(1)
bt.add(7)
bt.add(9)
bt.add(11)
bt.add(10)
expected = 11
actual = bt.find_maximum_value()
assert actual == expected
def test_add_three_to_tree():
new_tree = BinaryTree()
new_tree.add(2)
assert new_tree.root.value == 2
new_tree.add(7)
assert new_tree.root.left.value == 7
new_tree.add(5)
assert new_tree.root.right.value == 5
def test_three():
tree = BinaryTree()
tree.add(5)
tree.add(15)
tree.add(3)
actual = tree.pre_order()
expected = 15
assert actual == expected
def test_negative_max_value():
new_tree = BinaryTree()
expected = -2
new_tree.add(-2)
new_tree.add(-3)
new_tree.add(-7)
new_tree.add(-5)
new_tree.add(-2)
new_tree.add(-6)
new_tree.add(-9)
new_tree.add(-5)
new_tree.add(-11)
new_tree.add(-4)
assert new_tree.find_maximum_value() == expected
def test_maximum_value():
new_tree = BinaryTree()
expected = 11
new_tree.add(2)
new_tree.add(7)
new_tree.add(5)
new_tree.add(2)
new_tree.add(6)
new_tree.add(9)
new_tree.add(5)
new_tree.add(11)
new_tree.add(4)
assert new_tree.find_maximum_value() == expected
def test_add_one_to_tree():
new_tree = BinaryTree()
new_tree.add(2)
assert new_tree.root.value == 2
def test_breadth_first_nine():
new_tree = BinaryTree()
expected = [2,7,5,2,6,9,5,11,4]
new_tree.add(2)
new_tree.add(7)
new_tree.add(5)
new_tree.add(2)
new_tree.add(6)
new_tree.add(9)
new_tree.add(5)
new_tree.add(11)
new_tree.add(4)
assert new_tree.breadth_first() == expected
def test_breadth_first_three():
new_tree, expected = BinaryTree(), [2,7,5]
new_tree.add(2)
new_tree.add(7)
new_tree.add(5)
assert new_tree.breadth_first() == expected
def test_one():
tree = BinaryTree()
tree.add(11)
actual = tree.find_maximum_value()
expected = 11
assert actual == expected
def test_max_value_negative():
bt = BinaryTree()
bt.add(4)
bt.add(2)
bt.add(-1)
bt.add(7)
bt.add(-9)
bt.add(1)
bt.add(10)
expected = 10
actual = bt.find_maximum_value()
assert actual == expected