|
1 |
| -# -*- coding: utf-8 -*- |
2 | 1 | import unittest
|
3 | 2 |
|
4 | 3 | from pygorithm.data_structures import (
|
5 | 4 | stack,
|
6 | 5 | queue,
|
7 | 6 | linked_list,
|
8 |
| - tree, |
9 |
| - heap) |
| 7 | + tree) |
10 | 8 |
|
11 | 9 | class TestStack(unittest.TestCase):
|
12 | 10 | def test_stack(self):
|
@@ -133,34 +131,5 @@ def test_binary_search_tree(self):
|
133 | 131 |
|
134 | 132 | self.assertTrue(root.find(8))
|
135 | 133 |
|
136 |
| -class TestHeap(unittest.TestCase): |
137 |
| - def test_heap(self): |
138 |
| - myHeap = heap.Heap(limit = 4) |
139 |
| - myHeap.insert(2) # [2] |
140 |
| - myHeap.insert(10) # [2, 10] |
141 |
| - myHeap.insert(12) # [2, 10, 12] |
142 |
| - myHeap.insert(3) # [2, 3, 10, 12] |
143 |
| - |
144 |
| - expectedResult = [2, 3, 10, 12] |
145 |
| - self.assertEqual(myHeap.queue(), expectedResult) |
146 |
| - |
147 |
| - self.assertEqual(myHeap.pop(), 2) |
148 |
| - expectedResult = [3, 10, 12] |
149 |
| - self.assertEqual(myHeap.queue(), expectedResult) |
150 |
| - |
151 |
| - self.assertEqual(myHeap.pop(), 3) |
152 |
| - expectedResult = [10, 12] |
153 |
| - self.assertEqual(myHeap.queue(), expectedResult) |
154 |
| - |
155 |
| - self.assertEqual(myHeap.pop(), 10) |
156 |
| - expectedResult = [12] |
157 |
| - self.assertEqual(myHeap.queue(), expectedResult) |
158 |
| - |
159 |
| - self.assertEqual(myHeap.pop(), 12) |
160 |
| - expectedResult = [] |
161 |
| - self.assertEqual(myHeap.queue(), expectedResult) |
162 |
| - |
163 |
| - self.assertTrue(myHeap.is_empty()) |
164 |
| - |
165 | 134 | if __name__ == '__main__':
|
166 | 135 | unittest.main()
|
0 commit comments