def test_in_order():
tree = BinarySearchTree()
tree.add(50)
tree.add(25)
tree.add(75)
tree.add(20)
tree.add(80)
tree.add(40)
"""
50
25 75
20 40 80
"""
actual = tree.in_order()
expected = [20, 25, 40, 50, 75, 80]
assert actual == expected
def test_inorder():
tree = BinarySearchTree(5)
tree.add(3)
tree.add(19)
assert tree.in_order() == [3, 5, 19]
