/
test_single_threaded_binary_trees.py
323 lines (269 loc) · 7.37 KB
/
test_single_threaded_binary_trees.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
312
313
314
315
316
317
318
319
320
321
322
323
"""Unit tests for the single threaded binary search tree module."""
from forest.binary_trees import single_threaded_binary_trees
def test_simple_right_threaded_case(basic_tree):
"""Test the basic opeartions of a right threaded binary search tree."""
tree = single_threaded_binary_trees.RightThreadedBinaryTree()
# 23, 4, 30, 11, 7, 34, 20, 24, 22, 15, 1
for key, data in basic_tree:
tree.insert(key=key, data=data)
assert [
(1, "1"),
(4, "4"),
(7, "7"),
(11, "11"),
(15, "15"),
(20, "20"),
(22, "22"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
] == [item for item in tree.inorder_traverse()]
assert [
(23, "23"),
(4, "4"),
(1, "1"),
(11, "11"),
(7, "7"),
(20, "20"),
(15, "15"),
(22, "22"),
(30, "30"),
(24, "24"),
(34, "34"),
] == [item for item in tree.preorder_traverse()]
assert tree.get_leftmost(node=tree.root).key == 1
assert tree.get_rightmost(node=tree.root).key == 34
assert tree.search(key=24).data == "24"
tree.delete(key=34)
assert tree.search(key=34) is None
tree.delete(key=15)
tree.delete(key=22)
tree.delete(key=7)
tree.delete(key=20)
assert tree.search(key=15) is None
assert [(1, "1"), (4, "4"), (11, "11"), (23, "23"), (24, "24"), (30, "30")] == [
item for item in tree.inorder_traverse()
]
def test_deletion_right_threaded_case(basic_tree):
"""Test the deletion of a right threaded binary search tree."""
tree = single_threaded_binary_trees.RightThreadedBinaryTree()
# 23, 4, 30, 11, 7, 34, 20, 24, 22, 15, 1
for key, data in basic_tree:
tree.insert(key=key, data=data)
# No child
tree.delete(15)
assert [
(1, "1"),
(4, "4"),
(7, "7"),
(11, "11"),
(20, "20"),
(22, "22"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
] == [item for item in tree.inorder_traverse()]
# One right child
tree.delete(20)
assert [
(1, "1"),
(4, "4"),
(7, "7"),
(11, "11"),
(22, "22"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
] == [item for item in tree.inorder_traverse()]
# One left child
tree.insert(key=17, data="17")
tree.delete(22)
assert [
(1, "1"),
(4, "4"),
(7, "7"),
(11, "11"),
(17, "17"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
] == [item for item in tree.inorder_traverse()]
# Two children
tree.delete(11)
assert [
(1, "1"),
(4, "4"),
(7, "7"),
(17, "17"),
(23, "23"),
(24, "24"),
(30, "30"),
(34, "34"),
] == [item for item in tree.inorder_traverse()]
# Delete the root
tree.delete(23)
assert [
(1, "1"),
(4, "4"),
(7, "7"),
(17, "17"),
(24, "24"),
(30, "30"),
(34, "34"),
] == [item for item in tree.inorder_traverse()]
def test_deletion_right_threaded_empty():
"""Test deletion when right threaded binary tree is a chain and becomes empty."""
tree = single_threaded_binary_trees.RightThreadedBinaryTree()
for key in reversed(range(2)):
tree.insert(key=key, data=str(key))
for key in reversed(range(2)):
tree.delete(key=key)
assert tree.empty
def test_simple_left_threaded_case(basic_tree):
"""Test the basic opeartions of a left threaded binary search tree."""
tree = single_threaded_binary_trees.LeftThreadedBinaryTree()
# 23, 4, 30, 11, 7, 34, 20, 24, 22, 15, 1
for key, data in basic_tree:
tree.insert(key=key, data=data)
assert [
(34, "34"),
(30, "30"),
(24, "24"),
(23, "23"),
(22, "22"),
(20, "20"),
(15, "15"),
(11, "11"),
(7, "7"),
(4, "4"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
assert tree.get_leftmost(node=tree.root).key == 1
assert tree.get_rightmost(node=tree.root).key == 34
assert tree.search(key=24).data == "24"
tree.delete(key=15)
tree.delete(key=22)
tree.delete(key=7)
tree.delete(key=20)
assert tree.search(key=15) is None
assert [
(34, "34"),
(30, "30"),
(24, "24"),
(23, "23"),
(11, "11"),
(4, "4"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
def test_deletion_left_threaded_case(basic_tree):
"""Test the deletion of a left threaded binary search tree."""
tree = single_threaded_binary_trees.LeftThreadedBinaryTree()
# 23, 4, 30, 11, 7, 34, 20, 24, 22, 15, 1
for key, data in basic_tree:
tree.insert(key=key, data=data)
# No child
tree.delete(15)
assert [
(34, "34"),
(30, "30"),
(24, "24"),
(23, "23"),
(22, "22"),
(20, "20"),
(11, "11"),
(7, "7"),
(4, "4"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
# One right child
tree.delete(20)
assert [
(34, "34"),
(30, "30"),
(24, "24"),
(23, "23"),
(22, "22"),
(11, "11"),
(7, "7"),
(4, "4"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
# One left child
tree.insert(key=17, data="17")
tree.delete(22)
assert [
(34, "34"),
(30, "30"),
(24, "24"),
(23, "23"),
(17, "17"),
(11, "11"),
(7, "7"),
(4, "4"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
# Two children
tree.delete(11)
assert [
(34, "34"),
(30, "30"),
(24, "24"),
(23, "23"),
(17, "17"),
(7, "7"),
(4, "4"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
# Delete the root
tree.delete(23)
assert [
(34, "34"),
(30, "30"),
(24, "24"),
(17, "17"),
(7, "7"),
(4, "4"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
def test_deletion_left_threaded_case_2():
"""Test the deletion of a left threaded binary tree."""
tree = single_threaded_binary_trees.LeftThreadedBinaryTree()
test_tree = [
(4, "4"),
(1, "1"),
(7, "7"),
(3, "3"),
(5, "5"),
(8, "8"),
(2, "2"),
(6, "6"),
]
for key, data in test_tree:
tree.insert(key=key, data=data)
tree.delete(4)
assert [
(8, "8"),
(7, "7"),
(6, "6"),
(5, "5"),
(3, "3"),
(2, "2"),
(1, "1"),
] == [item for item in tree.reverse_inorder_traverse()]
def test_deletion_left_threaded_empty():
"""Test deletion when left threaded binary tree is a chain and becomes empty."""
tree = single_threaded_binary_trees.LeftThreadedBinaryTree()
for key in range(10):
tree.insert(key=key, data=str(key))
for key in range(10):
tree.delete(key=key)
assert tree.empty
for key in reversed(range(10)):
tree.insert(key=key, data=str(key))
for key in reversed(range(10)):
tree.delete(key=key)
assert tree.empty