def test_max_heap_1(self): mh = binary_max_heap(test_list) slist = test_list[:] slist.sort(reverse=True) for i in xrange(len(slist)): mh_max = mh.max_heap_extract() self.assertEqual(slist[i], mh_max)
def test_max_heap_data_right(self): mh = binary_max_heap(data_right) tlist = data_right[:] tlist.sort(reverse=True) data = mh.max_heap_get_max() self.assertEqual(9, data) self.assertEqual(tlist, mh.max_heap_sort())
def test_max_heap_data_one(self): mh = binary_max_heap(data_one) mh.max_heap_insert(3) data = mh.max_heap_extract() self.assertEqual(9, data) data = mh.max_heap_extract() self.assertEqual(3, data) ret = mh.max_heap_sort() self.assertEqual(ret, [])
def test_max_heap_max_2(self): test_data = [6, 4, 1, 9, 5, 2] mh = binary_max_heap(test_data) test_data.sort(reverse=True) self.assertEqual(test_data[0], mh.max_heap_get_max())
def test_max_heap_max(self): test_data = generate_random_list(9, 1, 49) mh = binary_max_heap(test_data) test_data.sort(reverse=True) self.assertEqual(test_data[0], mh.max_heap_get_max())
def test_max_heap_2(self): mh = binary_max_heap(test_list2) slist = test_list2[:] slist.sort(reverse=True) ret = mh.max_heap_sort() self.assertEqual(ret, slist)