def test_binary_tree(self):
data = [10, 5, 15, 4, 7, 13, 17, 11, 14]
# create 2 trees with the same content
root = binary_tree.Node(data[0])
for i in data[1:]:
root.insert(i)
root2 = binary_tree.Node(data[0])
for i in data[1:]:
root2.insert(i)
# check if both trees are identical
self.assertTrue(root.compare_trees(root2))
# check the content of the tree inorder
t = []
for d in root.tree_data():
t.append(d)
self.assertEquals(t, [4, 5, 7, 10, 11, 13, 14, 15, 17])
# test lookup
node, parent = root.lookup(9)
self.assertTrue(node is None)
# check if returned node and parent are correct
node, parent = root.lookup(11)
self.assertTrue(node.data == 11)
self.assertTrue(parent.data == 13)
# delete a leaf node
root.delete(4)
# check the content of the tree inorder
t = []
for d in root.tree_data():
t.append(d)
self.assertEquals(t, [5, 7, 10, 11, 13, 14, 15, 17])
# delete a node with 1 child
root.delete(5)
# check the content of the tree inorder
t = []
for d in root.tree_data():
t.append(d)
self.assertEquals(t, [7, 10, 11, 13, 14, 15, 17])
# delete a node with 2 children
root.delete(13)
# check the content of the tree inorder
t = []
for d in root.tree_data():
t.append(d)
self.assertEquals(t, [7, 10, 11, 14, 15, 17])
# delete a node with 2 children
root.delete(15)
# check the content of the tree inorder
t = []
for d in root.tree_data():
t.append(d)
self.assertEquals(t, [7, 10, 11, 14, 17])
def setUp(self):
self.root_single_node = binary_tree.Node(None)
self.root = binary_tree.Node(10)
self.root.left = binary_tree.Node(5)
self.root.left.left = binary_tree.Node(3)
self.root.left.right = binary_tree.Node(7)
self.root.right = binary_tree.Node(15)
self.root.right.left = binary_tree.Node(12)
self.root.right.left.left = binary_tree.Node(11)
self.root.right.right = binary_tree.Node(20)
self.root_copy = copy.deepcopy(self.root)