def testMin(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) expected = min(l) self.assertEqual(expected, tree.min())