def testIsBST(self):
bstOne = BinarySearchTree()
l = [8, 4, 2, 1, 3, 6, 5, 7, 12, 10, 9, 11, 14, 13, 15]
for d in l:
bstOne.insert(d)
self.assertTrue(bstOne.isBST())
bstTwo = BinarySearchTree()
l = range(100)
for d in l:
bstTwo.insert(d)
self.assertTrue(bstTwo.isBST())
