-
Notifications
You must be signed in to change notification settings - Fork 0
/
binarytree_test.py
217 lines (187 loc) · 7.8 KB
/
binarytree_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
#!python
from binarytree import BinarySearchTree, BinaryTreeNode
import unittest
class BinaryTreeNodeTest(unittest.TestCase):
def test_init(self):
data = 123
node = BinaryTreeNode(data)
assert node.data is data
assert node.left is None
assert node.right is None
def test_is_leaf(self):
# Create node with no children
node = BinaryTreeNode(2)
assert node.is_leaf() is True
# Attach left child node
node.left = BinaryTreeNode(1)
assert node.is_leaf() is False
# Attach right child node
node.right = BinaryTreeNode(3)
assert node.is_leaf() is False
# Detach left child node
node.left = None
assert node.is_leaf() is False
# Detach right child node
node.right = None
assert node.is_leaf() is True
def test_is_branch(self):
# Create node with no children
node = BinaryTreeNode(2)
assert node.is_branch() is False
# Attach left child node
node.left = BinaryTreeNode(1)
assert node.is_branch() is True
# Attach right child node
node.right = BinaryTreeNode(3)
assert node.is_branch() is True
# Detach left child node
node.left = None
assert node.is_branch() is True
# Detach right child node
node.right = None
assert node.is_branch() is False
class BinarySearchTreeTest(unittest.TestCase):
def test_init(self):
tree = BinarySearchTree()
assert tree.root is None
assert tree.size == 0
assert tree.is_empty() is True
def test_init_with_list(self):
tree = BinarySearchTree([2, 1, 3])
assert tree.root.data == 2
assert tree.root.left.data == 1
assert tree.root.right.data == 3
assert tree.size == 3
assert tree.is_empty() is False
def test_init_with_list_of_strings(self):
tree = BinarySearchTree(['B', 'A', 'C'])
assert tree.root.data == 'B'
assert tree.root.left.data == 'A'
assert tree.root.right.data == 'C'
assert tree.size == 3
assert tree.is_empty() is False
def test_init_with_list_of_tuples(self):
tree = BinarySearchTree([(2, 'B'), (1, 'A'), (3, 'C')])
assert tree.root.data == (2, 'B')
assert tree.root.left.data == (1, 'A')
assert tree.root.right.data == (3, 'C')
assert tree.size == 3
assert tree.is_empty() is False
def test_size(self):
tree = BinarySearchTree()
assert tree.size == 0
tree.insert('B')
assert tree.size == 1
tree.insert('A')
assert tree.size == 2
tree.insert('C')
assert tree.size == 3
def test_search_with_3_items(self):
# Create a complete binary search tree of 3 items in level-order
items = [2, 1, 3]
tree = BinarySearchTree(items)
assert tree.search(1) == 1
assert tree.search(2) == 2
assert tree.search(3) == 3
assert tree.search(4) is None
def test_search_with_7_items(self):
# Create a complete binary search tree of 7 items in level-order
items = [4, 2, 6, 1, 3, 5, 7]
tree = BinarySearchTree(items)
for item in items:
assert tree.search(item) == item
assert tree.search(8) is None
def test_search_with_3_strings(self):
# Create a complete binary search tree of 3 items in level-order
items = ['B', 'A', 'C']
tree = BinarySearchTree(items)
assert tree.search('A') == 'A'
assert tree.search('B') == 'B'
assert tree.search('C') == 'C'
assert tree.search('D') is None
def test_search_with_7_strings(self):
# Create a complete binary search tree of 7 items in level-order
items = ['D', 'B', 'F', 'A', 'C', 'E', 'G']
tree = BinarySearchTree(items)
for item in items:
assert tree.search(item) == item
assert tree.search('H') is None
def test_insert_with_3_items(self):
# Create a complete binary search tree of 3 items in level-order
tree = BinarySearchTree()
tree.insert(2)
assert tree.root.data == 2
assert tree.root.left is None
assert tree.root.right is None
tree.insert(1)
assert tree.root.data == 2
assert tree.root.left.data == 1
assert tree.root.right is None
tree.insert(3)
assert tree.root.data == 2
assert tree.root.left.data == 1
assert tree.root.right.data == 3
def test_insert_with_7_items(self):
# Create a complete binary search tree of 7 items in level-order
items = [4, 2, 6, 1, 3, 5, 7]
tree = BinarySearchTree()
for item in items:
tree.insert(item)
assert tree.root.data == 4
assert tree.root.left.data == 2
assert tree.root.right.data == 6
assert tree.root.left.left.data == 1
assert tree.root.left.right.data == 3
assert tree.root.right.left.data == 5
assert tree.root.right.right.data == 7
# This space intentionally left blank (please do not delete this comment)
def test_items_in_order_with_3_strings(self):
# Create a complete binary search tree of 3 strings in level-order
items = ['B', 'A', 'C']
tree = BinarySearchTree(items)
# Ensure the in-order traversal of tree items is ordered correctly
assert tree.items_in_order() == ['A', 'B', 'C']
def test_items_pre_order_with_3_strings(self):
# Create a complete binary search tree of 3 strings in level-order
items = ['B', 'A', 'C']
tree = BinarySearchTree(items)
# Ensure the pre-order traversal of tree items is ordered correctly
assert tree.items_pre_order() == ['B', 'A', 'C']
def test_items_post_order_with_3_strings(self):
# Create a complete binary search tree of 3 strings in level-order
items = ['B', 'A', 'C']
tree = BinarySearchTree(items)
# Ensure the post-order traversal of tree items is ordered correctly
assert tree.items_post_order() == ['A', 'C', 'B']
def test_items_level_order_with_3_strings(self):
# Create a complete binary search tree of 3 strings in level-order
items = ['B', 'A', 'C']
tree = BinarySearchTree(items)
# Ensure the level-order traversal of tree items is ordered correctly
assert tree.items_level_order() == ['B', 'A', 'C']
def test_items_in_order_with_7_numbers(self):
# Create a complete binary search tree of 7 items in level-order
items = [4, 2, 6, 1, 3, 5, 7]
tree = BinarySearchTree(items)
# Ensure the in-order traversal of tree items is ordered correctly
assert tree.items_in_order() == [1, 2, 3, 4, 5, 6, 7]
def test_items_pre_order_with_7_numbers(self):
# Create a complete binary search tree of 7 items in level-order
items = [4, 2, 6, 1, 3, 5, 7]
tree = BinarySearchTree(items)
# Ensure the pre-order traversal of tree items is ordered correctly
assert tree.items_pre_order() == [4, 2, 1, 3, 6, 5, 7]
def test_items_post_order_with_7_numbers(self):
# Create a complete binary search tree of 7 items in level-order
items = [4, 2, 6, 1, 3, 5, 7]
tree = BinarySearchTree(items)
# Ensure the post-order traversal of tree items is ordered correctly
assert tree.items_post_order() == [1, 3, 2, 5, 7, 6, 4]
def test_items_level_order_with_7_numbers(self):
# Create a complete binary search tree of 7 items in level-order
items = [4, 2, 6, 1, 3, 5, 7]
tree = BinarySearchTree(items)
# Ensure the level-order traversal of tree items is ordered correctly
assert tree.items_level_order() == [4, 2, 6, 1, 3, 5, 7]
if __name__ == '__main__':
unittest.main()