def testSearchForData(self):
tree = BinarySearchTree()
l = [8, 4, 2, 1, 3, 6, 5, 7, 12, 10, 9, 11, 14, 13, 15]
for d in l:
tree.insert(d)
for i in l:
self.assertTrue(tree.search(i))
self.assertFalse(tree.search(-1))
def testDelete(self):
tree = BinarySearchTree()
l = [8, 4, 2, 1, 3, 6, 5, 7, 12, 10, 9, 11, 14, 13, 15]
for d in l:
tree.insert(d)
# delete elements one by one and verify that it doesn't exist
deleted = []
for x in l:
deleted.append(x)
tree = tree.delete(x)
#verfiy all other elements exist
checks = [d for d in l if d not in deleted]
for v in checks:
self.assertTrue(tree and tree.search(v))
#verify x doesn't exist
self.assertFalse(tree and tree.search(x))
