-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.py
311 lines (261 loc) · 9.44 KB
/
test.py
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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
from unittest import TestCase
from bst import Node, from_list
class FromListTestCase(TestCase):
def test_empty_heap(self):
array = []
node = from_list(array)
self.assertIsNone(node)
def test_length_1_heap(self):
array = [0]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNone(node.left)
self.assertIsNone(node.right)
def test_length_1_heap_with_missing_value(self):
array = [None]
node = from_list(array)
self.assertIsNone(node)
def test_length_2_heap(self):
array = [0, 1]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNone(node.right)
def test_length_2_heap_with_missing_value(self):
array = [0, None]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNone(node.left)
self.assertIsNone(node.right)
def test_length_3_heap(self):
array = [0, 1, 2]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNotNone(node.right)
self.assertEqual(node.right.value, 2)
def test_length_3_heap_with_missing_value(self):
array = [0, 1, None]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNone(node.right)
def test_length_4_heap(self):
array = [0, 1, 2, 3]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNotNone(node.right)
self.assertEqual(node.right.value, 2)
self.assertIsNotNone(node.left.left)
self.assertEqual(node.left.left.value, 3)
def test_length_5_heap(self):
array = [0, 1, 2, 3, 4]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNotNone(node.right)
self.assertEqual(node.right.value, 2)
self.assertIsNotNone(node.left.left)
self.assertEqual(node.left.left.value, 3)
self.assertIsNotNone(node.left.right)
self.assertEqual(node.left.right.value, 4)
def test_length_6_heap(self):
array = [0, 1, 2, 3, 4, 5]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNotNone(node.right)
self.assertEqual(node.right.value, 2)
self.assertIsNotNone(node.left.left)
self.assertEqual(node.left.left.value, 3)
self.assertIsNotNone(node.left.right)
self.assertEqual(node.left.right.value, 4)
self.assertIsNotNone(node.right.left)
self.assertEqual(node.right.left.value, 5)
def test_length_7_heap(self):
array = [0, 1, 2, 3, 4, 5, 6]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNotNone(node.right)
self.assertEqual(node.right.value, 2)
self.assertIsNotNone(node.left.left)
self.assertEqual(node.left.left.value, 3)
self.assertIsNotNone(node.left.right)
self.assertEqual(node.left.right.value, 4)
self.assertIsNotNone(node.right.left)
self.assertEqual(node.right.left.value, 5)
self.assertIsNotNone(node.right.right)
self.assertEqual(node.right.right.value, 6)
def test_length_7_heap_with_missing_left_tree(self):
array = [0, None, 2, None, None, 5, 6]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNone(node.left)
self.assertIsNotNone(node.right)
self.assertEqual(node.right.value, 2)
self.assertIsNotNone(node.right.left)
self.assertEqual(node.right.left.value, 5)
self.assertIsNotNone(node.right.right)
self.assertEqual(node.right.right.value, 6)
def test_length_7_heap_with_missing_right_tree(self):
array = [0, 1, None, 3, 4]
node = from_list(array)
self.assertIsNotNone(node)
self.assertEqual(node.value, 0)
self.assertIsNotNone(node.left)
self.assertEqual(node.left.value, 1)
self.assertIsNone(node.right)
self.assertIsNotNone(node.left.left)
self.assertEqual(node.left.left.value, 3)
self.assertIsNotNone(node.left.right)
self.assertEqual(node.left.right.value, 4)
class ValidateTestCase(TestCase):
def test_tree(self):
bst = Node(2, Node(1), Node(3))
self.assertTrue(bst.validate())
def test_invalid_tree(self):
bst = Node(2, Node(3), Node(1))
self.assertFalse(bst.validate())
def test_leaf(self):
bst = Node(1)
self.assertTrue(bst.validate())
def test_left_subtree(self):
bst = Node(2, left=Node(1))
self.assertTrue(bst.validate())
def test_invalid_left_subtree(self):
bst = Node(2, left=Node(3))
self.assertFalse(bst.validate())
def test_right_subtree(self):
bst = Node(2, right=Node(3))
self.assertTrue(bst.validate())
def test_invalid_right_subtree(self):
bst = Node(2, right=Node(1))
self.assertFalse(bst.validate())
class MaximumTestCase(TestCase):
def test_leaf(self):
bst = Node(1)
maximum = bst.maximum()
self.assertEqual(maximum, 1)
def test_tree(self):
bst = Node(1, right=Node(2))
maximum = bst.maximum()
self.assertEqual(maximum, 2)
class MinimumTestCase(TestCase):
def test_leaf(self):
bst = Node(1)
minimum = bst.minimum()
self.assertEqual(minimum, 1)
def test_tree(self):
bst = Node(2, left=Node(1))
minimum = bst.minimum()
self.assertEqual(minimum, 1)
class ContainsTestCase(TestCase):
def test_false(self):
bst = Node(1)
has = bst.contains(0)
self.assertFalse(has)
def test_root(self):
bst = Node(1)
has = bst.contains(1)
self.assertTrue(has)
def test_left_subtree(self):
bst = Node(2, left=Node(1))
has = bst.contains(1)
self.assertTrue(has)
def test_right_subtree(self):
bst = Node(0, right=Node(1))
has = bst.contains(1)
self.assertTrue(has)
class InsertTestCase(TestCase):
def test_root(self):
bst = Node(1)
node = bst.insert(1)
self.assertEqual(bst, node)
def test_left_leaf(self):
bst = Node(2)
exp = Node(1)
node = bst.insert(1)
self.assertEqual(node, exp)
self.assertEqual(bst, Node(2, exp))
def test_left(self):
bst = Node(2, left=Node(0))
exp = Node(1, left=Node(0))
node = bst.insert(1)
self.assertEqual(node, exp)
self.assertEqual(bst, Node(2, left=exp))
def test_left_subtree(self):
bst = Node(3, left=Node(2))
exp = Node(1)
node = bst.insert(1)
self.assertEqual(node, exp)
self.assertEqual(bst, Node(3, left=Node(2, left=exp)))
def test_right_leaf(self):
bst = Node(0)
exp = Node(1)
node = bst.insert(1)
self.assertEqual(node, exp)
self.assertEqual(bst, Node(0, right=exp))
def test_right(self):
bst = Node(0, right=Node(2))
exp = Node(1, right=Node(2))
node = bst.insert(1)
self.assertEqual(node, exp)
self.assertEqual(bst, Node(0, right=exp))
def test_right_subtree(self):
bst = Node(-1, right=Node(0))
exp = Node(1)
node = bst.insert(1)
self.assertEqual(node, exp)
self.assertEqual(bst, Node(-1, right=Node(0, right=exp)))
class DeleteTestCase(TestCase):
def test_root(self):
bst = Node(1)
with self.assertRaises(RuntimeError):
bst.delete(1)
def test_left_leaf(self):
bst = Node(2)
removed = bst.delete(1)
self.assertFalse(removed)
def test_left_subtree(self):
bst = Node(2, left=Node(1, left=Node(0)))
removed = bst.delete(1)
self.assertTrue(removed)
self.assertEqual(bst, Node(2, left=Node(0)))
def test_left(self):
bst = Node(3, left=Node(2, left=Node(1)))
removed = bst.delete(1)
self.assertTrue(removed)
self.assertEqual(bst, Node(3, left=Node(2)))
def test_right_leaf(self):
bst = Node(0)
removed = bst.delete(1)
self.assertFalse(removed)
def test_right_subtree(self):
bst = Node(0, right=Node(1, right=Node(2)))
removed = bst.delete(1)
self.assertTrue(removed)
self.assertEqual(bst, Node(0, right=Node(2)))
def test_right(self):
bst = Node(-1, right=Node(0, right=Node(1)))
removed = bst.delete(1)
self.assertTrue(removed)
self.assertEqual(bst, Node(-1, right=Node(0)))