def test_find_bigger_and_delete():
tree = BinaryTree()
tree.insert(5)
tree.insert(10)
assert tree.root.right.value == 10
tree.delete(10)
assert tree.root.right is None
assert tree.find(10) == False
def test_find_smaller_and_delete():
tree = BinaryTree()
tree.insert(5)
tree.insert(1)
assert tree.root.left.value == 1
tree.delete(1)
assert tree.root.left is None
assert tree.find(1) == False
def test_find():
tree = BinaryTree()
tree.insert(0)
assert tree.empty() == False
assert tree.find(0) == True
def test_empty():
tree = BinaryTree()
assert tree.empty() == True
assert tree.find(0) == False
def test_find_after_deleted():
tree = BinaryTree()
tree.insert(0)
tree.delete(0)
assert tree.empty() == True
assert tree.find(0) == False
