def setup_one_add():
x = BinaryTree()
x.add(10)
return x
def test_delete_empty_tree_false():
x = BinaryTree()
assert x.delete(1) is False
def test_empty_tree():
x = BinaryTree()
assert x.head_node is None
def setup_multiple_adds():
x = BinaryTree()
x.add(10)
x.add(5)
x.add(19)
x.add(17)
x.add(16)
x.add(18)
x.add(23)
x.add(20)
return x
def setup_two_adds_right():
x = BinaryTree()
x.add(10)
x.add(15)
return x
def setup_two_adds_left():
x = BinaryTree()
x.add(10)
x.add(5)
return x
