def test_insert_and_get_many_random_items(self): heap = BinaryMinHeap() items = random.sample(range(1000), 50) for index, item in enumerate(items): heap.insert(item) assert heap.size() == index + 1 min_item = min(items[:index + 1]) assert heap.get_min() == min_item assert heap.size() == len(items)
def test_insert_and_get_many_items(self): heap = BinaryMinHeap() items = [9, 25, 86, 3, 29, 5, 55] for index, item in enumerate(items): heap.insert(item) assert heap.size() == index + 1 min_item = min(items[:index + 1]) assert heap.get_min() == min_item assert heap.size() == len(items) assert heap.items == [3, 9, 5, 25, 29, 86, 55]
def test_insert_and_get_one_item(self): heap = BinaryMinHeap() heap.insert(5) assert heap.size() == 1 assert heap.get_min() == 5 assert heap.items == [5]
def test_get_min_on_empty_heap(self): heap = BinaryMinHeap() with self.assertRaises(ValueError): heap.get_min()