def test_contains_true(self):
bst = UnbalancedBinarySearchTree()
bst.add(3)
bst.add(5)
bst.add(4)
bst.add(1)
bst.add(8)
george_boole = bst.search(bst.root, 1)
expected = True
self.assertEquals(expected, george_boole)
def test_very_big(self):
bst = UnbalancedBinarySearchTree()
array = []
helping_array = []
for i in range(77777):
d = randint(0, 1000)
if not bst.search(bst.root, d):
bst.add(d)
helping_array.append(d)
helping_array.sort()
for node in bst:
array.append(node)
expected = helping_array
self.assertEquals(expected, array)
