binary_heap/test_binary_heap.py at master · rameshrvr/binary_heap · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
from unittest import TestCase

from binary_heap import MinHeap, MaxHeap, heap_sort


class TestMinHeap(TestCase):
    def setUp(self):
        self.array = [4, 3, 6, 8, 11]

    def test_min_heap_property(self):
        min_heap = MinHeap(self.array)
        length = min_heap.length()
        elements = min_heap.elements()
        for i in range(0, length):
            current_value = elements[i]
            left_index = (2 * i) + 1
            right_index = (2 * i) + 2
            if left_index <= length - 1:
                self.assertLessEqual(current_value, elements[left_index])
            if right_index <= length - 1:
                self.assertLessEqual(current_value, elements[right_index])

    def test_min_heap_count_and_elements(self):
        min_heap = MinHeap(self.array)
        self.assertEqual(5, min_heap.length())
        self.assertEqual([3, 4, 6, 8, 11], min_heap.elements())

    def test_add_element_to_minheap(self):
        min_heap = MinHeap(self.array)
        min_heap.add_element(1)
        self.assertEqual(6, min_heap.length())
        self.assertEqual([1, 4, 3, 8, 11, 6], min_heap.elements())
        self.assertEqual(1, min_heap.get_root_value())

    def test_add_array_of_elements_to_minheap(self):
        min_heap = MinHeap(self.array)
        min_heap.add_element([1, 14, 7, 5])
        self.assertEqual(9, min_heap.length())
        self.assertEqual([1, 4, 3, 5, 11, 6, 14, 8, 7], min_heap.elements())
        self.assertEqual(1, min_heap.get_root_value())

    def test_delete_element_at_index_minheap(self):
        min_heap = MinHeap(self.array)
        min_heap.delete_element_at_index(3)
        self.assertEqual(4, min_heap.length())
        self.assertEqual([3, 4, 6, 11], min_heap.elements())

    def test_search_value_minheap(self):
        min_heap = MinHeap(self.array)
        index = min_heap.search_value(8)
        self.assertEqual(index, 3)
        index = min_heap.search_value(12)
        self.assertEqual(index, -1)

    def test_extract_root_value_minheap(self):
        min_heap = MinHeap(self.array)
        self.assertEqual(3, min_heap.extract_root())
        self.assertEqual([4, 8, 6, 11], min_heap.elements())

    def test_multiple_operations_minheap(self):
        min_heap = MinHeap(self.array)
        min_heap.add_element(5)
        self.assertEqual([3, 4, 5, 8, 11, 6], min_heap.elements())
        self.assertEqual(3, min_heap.extract_root())
        self.assertEqual([4, 6, 5, 8, 11], min_heap.elements())
        min_heap.add_element([1, 3, 5, 6])
        self.assertEqual([1, 5, 3, 6, 11, 5, 4, 8, 6], min_heap.elements())
        self.assertEqual(1, min_heap.extract_root())
        self.assertEqual(3, min_heap.extract_root())
        self.assertEqual([4, 5, 5, 6, 11, 8, 6], min_heap.elements())
        self.assertEqual([4, 5, 5, 6, 6, 8, 11], sorted(min_heap.elements()))


class TestMaxHeap(TestCase):
    def setUp(self):
        self.array = [4, 3, 6, 8, 11]

    def test_max_heap_property(self):
        max_heap = MaxHeap(self.array)
        length = max_heap.length()
        elements = max_heap.elements()
        for i in range(0, length):
            current_value = elements[i]
            left_index = (2 * i) + 1
            right_index = (2 * i) + 2
            if left_index <= length - 1:
                self.assertGreaterEqual(current_value, elements[left_index])
            if right_index <= length - 1:
                self.assertGreaterEqual(current_value, elements[right_index])

    def test_max_heap_count_and_elements(self):
        max_heap = MaxHeap(self.array)
        self.assertEqual(5, max_heap.length())
        self.assertEqual([11, 8, 6, 4, 3], max_heap.elements())

    def test_add_element_to_maxheap(self):
        max_heap = MaxHeap(self.array)
        max_heap.add_element(13)
        self.assertEqual(6, max_heap.length())
        self.assertEqual([13, 8, 11, 4, 3, 6], max_heap.elements())
        self.assertEqual(13, max_heap.get_root_value())
        self.assertEqual([13, 8, 11, 4, 3, 6], max_heap.elements())

    def test_add_array_of_elements_to_maxheap(self):
        max_heap = MaxHeap(self.array)
        max_heap.add_element([1, 14, 7, 5])
        self.assertEqual(9, max_heap.length())
        self.assertEqual([14, 8, 11, 7, 3, 1, 6, 4, 5], max_heap.elements())
        self.assertEqual(14, max_heap.get_root_value())

    def test_delete_element_at_index_maxheap(self):
        max_heap = MaxHeap(self.array)
        max_heap.delete_element_at_index(2)
        self.assertEqual(4, max_heap.length())
        self.assertEqual([11, 8, 3, 4], max_heap.elements())

    def test_search_value_maxheap(self):
        max_heap = MaxHeap(self.array)
        index = max_heap.search_value(8)
        self.assertEqual(index, 1)
        index = max_heap.search_value(44)
        self.assertEqual(index, -1)

    def test_extract_root_value_maxheap(self):
        max_heap = MaxHeap(self.array)
        self.assertEqual(11, max_heap.extract_root())
        self.assertEqual([8, 4, 6, 3], max_heap.elements())

    def test_multiple_operations_maxheap(self):
        max_heap = MaxHeap(self.array)
        max_heap.add_element(5)
        self.assertEqual([11, 8, 6, 4, 3, 5], max_heap.elements())
        self.assertEqual(11, max_heap.extract_root())
        self.assertEqual([8, 5, 6, 4, 3], max_heap.elements())
        max_heap.add_element([11, 13, 5, 6])
        self.assertEqual([13, 6, 11, 5, 3, 6, 8, 4, 5], max_heap.elements())
        self.assertEqual(13, max_heap.extract_root())
        self.assertEqual(11, max_heap.extract_root())
        self.assertEqual([8, 6, 6, 5, 3, 4, 5], max_heap.elements())
        self.assertEqual([3, 4, 5, 5, 6, 6, 8], sorted(max_heap.elements()))


class TestHeapSort(TestCase):
    def setUp(self):
        self.array1 = [4, 3, 6, 8, 11]
        self.array2 = [4, 1, 3, 2, 16, 9, 10, 14, 8, 7]

    def test_sorted_value_of_array1(self):
        self.assertEqual([3, 4, 6, 8, 11], heap_sort(self.array1))

    def test_sorted_value_of_array2(self):
        self.assertEqual(
            [1, 2, 3, 4, 7, 8, 9, 10, 14, 16],
            heap_sort(self.array2)
        )

    def test_reverse_sort_array1(self):
        self.assertEqual(
            [11, 8, 6, 4, 3], heap_sort(data=self.array1, reverse=True)
        )

    def test_reverse_sort_array2(self):
        self.assertEqual(
            [16, 14, 10, 9, 8, 7, 4, 3, 2, 1],
            heap_sort(data=self.array2, reverse=True)
        )