def test_bst_add_multiple():
bst = BinarySearchTree()
bst.add(4)
bst.add(9)
bst.add(-1)
bst.add(6)
bst.add(3)
bst.add(8)
bst.add(5)
assert bst.root.value == 4
assert bst.root.left.value == -1
assert bst.root.right.value == 9
assert bst.root.left.right.value == 3
assert bst.root.right.left.left.value == 5
def test_add_left_child_and_right_child():
bst = BinarySearchTree()
bst.add(50)
bst.add(100)
bst.add(25)
expected = 100
actual = bst.root.right.value
assert expected == actual
def test_bst_contain_empty():
bst = BinarySearchTree()
with pytest.raises(Exception):
assert bst.contains(7)
def test_bst_not_contain():
bst = BinarySearchTree()
bst.add(4)
bst.add(9)
bst.add(-1)
bst.add(6)
bst.add(3)
bst.add(8)
bst.add(5)
assert bst.contains(7) == False
def test_bst_add_single():
bst = BinarySearchTree()
bst.add(4)
assert bst.root.value == 4
def test_bst_empty():
bst = BinarySearchTree()
assert bst.root == None
def test_post_order_traversal():
bst = BinarySearchTree()
bst.add(50)
bst.add(100)
bst.add(30)
bst.add(25)
bst.add(33)
bst.add(70)
bst.add(105)
expected = [25, 33, 30, 70, 105, 100, 50]
actual = bst.post_order()
assert expected == actual
def test_single_root_tree():
bst = BinarySearchTree()
bst.add(50)
expected = 50
actual = bst.root.value
assert expected == actual