def testDepth(self):
tree = BinarySearchTree()
l = range(100)
for d in l:
tree.insert(d)
self.assertEqual(tree.getDepth(), len(l))
tree1 = BinarySearchTree()
l = [8, 4, 2, 1, 3, 6, 5, 7, 12, 10, 9, 11, 14, 13, 15]
for d in l:
tree1.insert(d)
self.assertEqual(tree1.getDepth(), 4)
