def testWellOrderedNess(self):
bst = BinarySearchTree()
l = [8, 4, 2, 1, 3, 6, 5, 7, 12, 10, 9, 11, 14, 13, 15]
for d in l:
bst.insert(d)
self.assertTrue(bst.wellOrdered())
bst.left.data = 300
self.assertFalse(bst.wellOrdered())
