def test_in_order():
tree = BinarySearchTree()
tree.add(10)
tree.add(5)
tree.add(15)
expected = [5, 10, 15]
actual = tree.in_order()
assert expected == actual
def test_return_inorder_traversal():
tree = BinarySearchTree()
traverse = BinaryTree()
tree.add(3)
tree.add(2)
tree.add(6)
actual = tree.in_order()
expected = [2,3,6]
assert actual == expected
def test_in_order():
"""
Can successfully return a collection from an inorder traversal
"""
tree = BinarySearchTree()
tree.add(6)
tree.add(5)
tree.add(7)
tree.add(8)
tree.add(3)
tree.add(4)
assert tree.in_order(tree.root) == [3, 4, 5, 6, 7, 8]
def test_in_order():
tree_stuff = BinarySearchTree()
tree_stuff.add(90)
tree_stuff.add(80)
tree_stuff.add(85)
tree_stuff.add(60)
tree_stuff.add(95)
tree_stuff.add(91)
tree_stuff.add(101)
actual = tree_stuff.in_order()
expected = [60, 80, 85, 90, 91, 95, 101]
assert actual == expected
def test_in_order():
tree = BinarySearchTree()
tree.add(6)
tree.add(8)
tree.add(7)
tree.add(4)
tree.add(9)
tree.add(3)
expected = [3, 4, 6, 7, 8, 9]
actual = tree.in_order()
assert expected == actual
def test_inorder():
bst = BinarySearchTree()
bst.add(4)
bst.add(7)
bst.add(5)
bst.add(9)
bst.add(2)
bst.add(30)
bst.add(-1)
expected = [-1, 2, 4, 5, 7, 9, 30]
actual = bst.in_order()
assert actual == expected
def test_in_order_empty():
tree = BinarySearchTree()
expected = []
actual = tree.in_order()
assert actual == expected
