def test_inorder():
bst = BinarySearchTree()
rbt = RedBlackTree()
data = gen_random_u_array(10)
for d in data:
bst.insert(d)
rbt.insert(d)
assert np.array_equal(bst.inorder(), rbt.inorder())
def test_insertion_bst():
data = gen_random_u_array()
sorted_data = SortedList(data)
bst = BinarySearchTree()
for d in data:
bst.insert(d)
assert np.array_equal(bst.inorder(), sorted_data)
def test_inorder():
"""Successfully returns an empty array from an empty binary tree"""
tree = BinarySearchTree()
tree.add('D')
tree.add('B')
tree.add('A')
tree.add('C')
tree.add('F')
tree.add('E')
assert tree.inorder() == ['A', 'B', 'C', 'D', 'E', 'F']
from tree import Tree, BinarySearchTree
t = Tree()
t.insert_root("A")
t.insert_left(t.root, "B")
t.insert_right(t.root, "C")
t.insert_left(t.root.left, "D")
t.insert_right(t.root.left, "E")
t.insert_right(t.root.right, "F")
print(t)
t2 = BinarySearchTree()
t2.insert(2)
t2.insert(5)
t2.insert(8)
t2.insert(11)
t2.insert(1)
t2.insert(7)
print(t2)
print(t2.inorder())
def test_inorder():
"""Successfully returns an array of inordered values from a binary tree"""
tree = BinarySearchTree()
assert tree.inorder() == []
