def test_in_order():
tree = BinarySearchTree()
tree.add(10)
tree.add(15)
expected = [10]
actual = tree.in_order()
assert expected == actual
def test_find_max_root_is_max(): tree = BinarySearchTree() tree.root = Node(23) tree.root.left = Node(19) tree.root.right = Node(7) tree.root.left.left = Node(5) tree.root.left.right = Node(8) assert tree.find_max_val(tree.root) == 23
def test_pre_order():
tree = BinarySearchTree()
tree.add(10)
tree.add(5)
tree.add(15)
expected = [10,5,15]
actual = tree.pre_order()
assert expected == actual
def test_three_members():
tree = BinarySearchTree()
tree.add(10)
tree.add(5)
tree.add(15)
assert tree.root.value == 10
assert tree.root.left.value == 5
assert tree.root.right.value == 15
def test_breadth_first_empty_list():
tree = BinarySearchTree()
assert tree.breadth_first() == 'tree is empty'
def test_breadth_first():
tree = BinarySearchTree()
tree.add(2)
tree.add(7)
tree.add(5)
tree.add(2)
tree.add(6)
tree.add(9)
tree.add(5)
tree.add(11)
tree.add(4)
assert tree.breadth_first() == [2, 7, 5, 2, 6, 9, 5, 11, 4]
def test_find_max():
tree = BinarySearchTree()
tree.add(10)
tree.add(5)
tree.add(15)
tree.add(-20)
tree.add(1)
assert tree.find_maximum_value() == 15
def test_tree_one_member():
tree = BinarySearchTree()
tree.add('apples')
assert tree.root.value == 'apples'
def test_find_max_root_no_root(): tree = BinarySearchTree() assert tree.find_max_val(tree.root) == None