from binary_heap import Heap

import pytest

@pytest.fixture

def empty_heap():

h = Heap()

return h

@pytest.fixture

def full_heap():

return h

@pytest.fixture

def random_heap():

return h

def test_heap():

h = Heap()

assert h.heap_list[0] == 0

def test_iter_heap():

l = [100, 19, 36, 17, 3, 25, 1, 2, 7]

h = Heap(l)

assert h.heap_list[1] == 100

def test_random_heap(random_heap):

assert random_heap.heap_list == [0, 150, 100, 2, 10, 20]

def test_push(empty_heap):

assert empty_heap.heap_list[2] == 25

def test_pop(full_heap):

assert full_heap.pop() == 100

assert full_heap.pop() == 36

assert full_heap.pop() == 25

def test_pop_from_empty_heap(empty_heap):

with pytest.raises(IndexError):

empty_heap.pop()