def test(self):
self.assertEqual(self.parent_node, self.tree.Root)
self.assertEqual('key1', self.tree.Root.NodeValue)
tree2 = BST(None)
self.assertEqual(None, tree2.Root)
self.assertEqual(0, tree2.Count())
def test_delete_root_leaf(self):
self.assertEqual(1, self.tree.Count())
self.tree.DeleteNodeByKey(1)
self.assertEqual(None, self.tree.Root)
self.assertEqual(0, self.tree.Count())
self.tree.AddKeyValue(1, 'key1')
self.tree.AddKeyValue(-5, 'key-5')
self.tree.AddKeyValue(-2, 'key-2')
self.tree.AddKeyValue(-6, 'key-6')
self.assertEqual(4, self.tree.Count())
self.tree.DeleteNodeByKey(1)
self.assertEqual(3, self.tree.Count())
self.assertEqual(-5, self.tree.Root.NodeKey)
self.assertEqual(-2, self.tree.Root.RightChild.NodeKey)
self.assertEqual(-6, self.tree.Root.LeftChild.NodeKey)
self.tree = BST(BSTNode(1, 'key1', None))
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(11, 'key11')
self.tree.AddKeyValue(16, 'key16')
self.tree.AddKeyValue(13, 'key13')
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(8, self.tree.Count())
self.tree.DeleteNodeByKey(1)
self.assertEqual(7, self.tree.Count())
def test_add_key_value_empty_root(self):
# check system hack
tree2 = BST(None)
tree2.AddKeyValue(12, 'key12')
self.assertEqual(1, tree2.Count())
self.assertEqual('key12', tree2.Root.NodeValue)
self.assertEqual(None, tree2.Root.LeftChild)
self.assertEqual(None, tree2.Root.RightChild)
def test_another_one_deleting(self):
self.tree = BST(BSTNode(50, 'key50', None))
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(70, 'key70')
self.tree.AddKeyValue(10, 'key10')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(90, 'key90')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(35, 'key30')
self.tree.AddKeyValue(45, 'key45')
self.assertEqual(10, self.tree.Count())
self.tree.DeleteNodeByKey(10)
self.assertEqual(9, self.tree.Count())
def test_delete_node_with_both_child_no_right_leaf(self):
self.tree = BST(BSTNode(50, 'key50', None))
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(70, 'key70')
self.tree.AddKeyValue(10, 'key10')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(90, 'key90')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(45, 'key45')
self.assertEqual(9, self.tree.Count())
self.tree.DeleteNodeByKey(20)
self.assertEqual(8, self.tree.Count())
self.assertEqual(None, self.tree.FindNodeByKey(40).Node.LeftChild)
self.assertEqual(45, self.tree.FindNodeByKey(40).Node.RightChild.NodeKey)
def setUp(self):
# 50
# / \
# 35 55
# / \ \
# 30 40 60
# / \ /
# 37 45 57
self.parent_node = BSTNode(50, 'key50', None)
self.tree = BST(self.parent_node)
self.tree.AddKeyValue(35, 'key35')
self.tree.AddKeyValue(55, 'key55')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(37, 'key37')
self.tree.AddKeyValue(45, 'key45')
self.tree.AddKeyValue(57, 'key57')
def test_delete_root_node_with_both_child(self):
self.tree = BST(BSTNode(50, 'key50', None))
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(70, 'key70')
self.tree.AddKeyValue(10, 'key10')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(90, 'key90')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(35, 'key30')
self.tree.AddKeyValue(45, 'key45')
self.assertEqual(10, self.tree.Count())
self.tree.DeleteNodeByKey(50)
self.assertEqual(9, self.tree.Count())
self.assertEqual(False, self.tree.FindNodeByKey(50).NodeHasKey)
self.assertEqual(60, self.tree.Root.NodeKey)
self.assertEqual(None, self.tree.Root.Parent)
self.assertEqual(20, self.tree.Root.LeftChild.NodeKey)
self.assertEqual(70, self.tree.Root.RightChild.NodeKey)
def setUp(self):
self.parent_node = BSTNode(1, 'key1', None)
self.tree = BST(self.parent_node)
class TestUM(unittest.TestCase):
def setUp(self):
self.parent_node = BSTNode(1, 'key1', None)
self.tree = BST(self.parent_node)
def test(self):
self.assertEqual(self.parent_node, self.tree.Root)
self.assertEqual('key1', self.tree.Root.NodeValue)
tree2 = BST(None)
self.assertEqual(None, tree2.Root)
self.assertEqual(0, tree2.Count())
def test_add_key_value_empty_root(self):
# check system hack
tree2 = BST(None)
tree2.AddKeyValue(12, 'key12')
self.assertEqual(1, tree2.Count())
self.assertEqual('key12', tree2.Root.NodeValue)
self.assertEqual(None, tree2.Root.LeftChild)
self.assertEqual(None, tree2.Root.RightChild)
def test_add_key_value(self):
self.tree.AddKeyValue(12, 'key12')
self.assertEqual(None, self.tree.Root.LeftChild)
self.assertEqual(12, self.tree.Root.RightChild.NodeKey)
self.assertEqual('key12', self.tree.Root.RightChild.NodeValue)
self.tree.AddKeyValue(0, 'key0')
self.assertEqual(0, self.tree.Root.LeftChild.NodeKey)
self.assertEqual('key0', self.tree.Root.LeftChild.NodeValue)
self.tree.AddKeyValue(11, 'key11')
self.assertEqual(None, self.tree.Root.RightChild.RightChild)
self.assertEqual(11, self.tree.Root.RightChild.LeftChild.NodeKey)
self.assertEqual(
'key11',
self.tree.Root.RightChild.LeftChild.NodeValue
)
self.tree.AddKeyValue(16, 'key16')
self.assertEqual(16, self.tree.Root.RightChild.RightChild.NodeKey)
self.assertEqual(
'key16',
self.tree.Root.RightChild.RightChild.NodeValue
)
self.tree.AddKeyValue(13, 'key13')
self.assertEqual(
13,
self.tree.Root.RightChild.RightChild.LeftChild.NodeKey
)
self.assertEqual(
'key13',
self.tree.Root.RightChild.RightChild.LeftChild.NodeValue
)
self.tree.AddKeyValue(20, 'key20')
self.assertEqual(
20,
self.tree.Root.RightChild.RightChild.RightChild.NodeKey
)
self.assertEqual(
'key20',
self.tree.Root.RightChild.RightChild.RightChild.NodeValue
)
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(
None,
self.tree.Root.RightChild.LeftChild.RightChild
)
self.assertEqual(
8,
self.tree.Root.RightChild.LeftChild.LeftChild.NodeKey
)
self.assertEqual(
'key8',
self.tree.Root.RightChild.LeftChild.LeftChild.NodeValue
)
self.tree.AddKeyValue(13, 'key13')
self.assertEqual(False, self.tree.AddKeyValue(13, 'key13'))
def test_find_node_by_key(self):
self.assertEqual(self.parent_node, self.tree.FindNodeByKey(1).Node)
self.assertEqual(True, self.tree.FindNodeByKey(1).NodeHasKey)
self.assertEqual(False, self.tree.FindNodeByKey(1).ToLeft)
self.assertEqual(self.parent_node, self.tree.FindNodeByKey(2).Node)
self.assertEqual(False, self.tree.FindNodeByKey(2).NodeHasKey)
self.assertEqual(False, self.tree.FindNodeByKey(2).ToLeft)
self.assertEqual(self.parent_node, self.tree.FindNodeByKey(0).Node)
self.assertEqual(False, self.tree.FindNodeByKey(0).NodeHasKey)
self.assertEqual(True, self.tree.FindNodeByKey(0).ToLeft)
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(11, 'key11')
self.tree.AddKeyValue(16, 'key16')
self.tree.AddKeyValue(13, 'key13')
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(
self.tree.Root.RightChild.LeftChild.LeftChild, self.tree.FindNodeByKey(8).Node)
self.assertEqual(True, self.tree.FindNodeByKey(8).NodeHasKey)
self.assertEqual(False, self.tree.FindNodeByKey(8).ToLeft)
self.assertEqual(
self.tree.Root.RightChild.LeftChild.LeftChild, self.tree.FindNodeByKey(7).Node)
self.assertEqual(False, self.tree.FindNodeByKey(7).NodeHasKey)
self.assertEqual(True, self.tree.FindNodeByKey(7).ToLeft)
def test_find_min_max(self):
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(11, 'key11')
self.tree.AddKeyValue(16, 'key16')
self.tree.AddKeyValue(13, 'key13')
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(
0,
self.tree.FinMinMax(self.tree.Root, False).NodeKey
)
self.assertEqual(
20,
self.tree.FinMinMax(self.tree.Root, True).NodeKey
)
self.assertEqual(
8,
self.tree.FinMinMax(self.tree.Root.RightChild, False).NodeKey
)
self.assertEqual(
20,
self.tree.FinMinMax(self.tree.Root.RightChild, True).NodeKey
)
def test_count(self):
self.assertEqual(1, self.tree.Count())
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(11, 'key11')
self.assertEqual(4, self.tree.Count())
self.tree.AddKeyValue(16, 'key16')
self.tree.AddKeyValue(13, 'key13')
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(8, self.tree.Count())
def test_delete_empty_tree(self):
tree2 = BST(None)
self.assertEqual(0, tree2.Count())
self.assertEqual(False, tree2.DeleteNodeByKey(777))
def test_delete_root_leaf(self):
self.assertEqual(1, self.tree.Count())
self.tree.DeleteNodeByKey(1)
self.assertEqual(None, self.tree.Root)
self.assertEqual(0, self.tree.Count())
self.tree.AddKeyValue(1, 'key1')
self.tree.AddKeyValue(-5, 'key-5')
self.tree.AddKeyValue(-2, 'key-2')
self.tree.AddKeyValue(-6, 'key-6')
self.assertEqual(4, self.tree.Count())
self.tree.DeleteNodeByKey(1)
self.assertEqual(3, self.tree.Count())
self.assertEqual(-5, self.tree.Root.NodeKey)
self.assertEqual(-2, self.tree.Root.RightChild.NodeKey)
self.assertEqual(-6, self.tree.Root.LeftChild.NodeKey)
self.tree = BST(BSTNode(1, 'key1', None))
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(11, 'key11')
self.tree.AddKeyValue(16, 'key16')
self.tree.AddKeyValue(13, 'key13')
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(8, self.tree.Count())
self.tree.DeleteNodeByKey(1)
self.assertEqual(7, self.tree.Count())
def test_delete_right_leaf_false(self):
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(11, 'key11')
self.tree.AddKeyValue(16, 'key16')
self.tree.AddKeyValue(13, 'key13')
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(False, self.tree.DeleteNodeByKey(777))
self.assertEqual(12, self.tree.FindNodeByKey(12).Node.NodeKey)
self.assertEqual('key12', self.tree.FindNodeByKey(12).Node.NodeValue)
self.tree.DeleteNodeByKey(12)
self.assertEqual(False, self.tree.FindNodeByKey(12).NodeHasKey)
self.assertEqual(
13,
self.tree.Root.RightChild.NodeKey
)
self.assertEqual(
16,
self.tree.Root.RightChild.RightChild.NodeKey
)
self.assertEqual(
11,
self.tree.Root.RightChild.LeftChild.NodeKey
)
self.assertEqual(
13,
self.tree.Root.RightChild.RightChild.Parent.NodeKey
)
self.assertEqual(
13,
self.tree.Root.RightChild.LeftChild.Parent.NodeKey
)
def test_delete_right_leaf_true(self):
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(11, 'key11')
self.tree.AddKeyValue(16, 'key16')
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(8, 'key8')
self.assertEqual(False, self.tree.DeleteNodeByKey(777))
self.assertEqual(12, self.tree.FindNodeByKey(12).Node.NodeKey)
self.assertEqual('key12', self.tree.FindNodeByKey(12).Node.NodeValue)
self.assertEqual(7, self.tree.Count())
self.tree.DeleteNodeByKey(12)
self.assertEqual(6, self.tree.Count())
self.assertEqual(False, self.tree.FindNodeByKey(12).NodeHasKey)
self.assertEqual(
16,
self.tree.Root.RightChild.NodeKey
)
self.assertEqual(
20,
self.tree.Root.RightChild.RightChild.NodeKey
)
self.assertEqual(
11,
self.tree.Root.RightChild.LeftChild.NodeKey
)
self.assertEqual(
16,
self.tree.Root.RightChild.RightChild.Parent.NodeKey
)
self.assertEqual(
16,
self.tree.Root.RightChild.LeftChild.Parent.NodeKey
)
def test_delete_root_node_without_children(self):
self.assertEqual(1, self.tree.Count())
self.tree.DeleteNodeByKey(1)
self.assertEqual(None, self.tree.Root)
self.assertEqual(0, self.tree.Count())
def test_delete_node_without_children(self):
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(0, 'key0')
self.tree.DeleteNodeByKey(0)
self.assertEqual(
self.parent_node,
self.tree.Root
)
self.assertEqual(
None,
self.tree.Root.LeftChild
)
self.assertEqual(
12,
self.tree.Root.RightChild.NodeKey
)
self.assertEqual(2, self.tree.Count())
self.tree.DeleteNodeByKey(12)
self.assertEqual(
self.parent_node,
self.tree.Root
)
self.assertEqual(
None,
self.tree.Root.RightChild
)
self.assertEqual(1, self.tree.Count())
def test_delete_root_node_with_one_child(self):
self.assertEqual(1, self.tree.Count())
self.tree.AddKeyValue(0, 'key0')
self.tree.DeleteNodeByKey(1)
self.assertEqual(0, self.tree.Root.NodeKey)
self.assertEqual(1, self.tree.Count())
self.assertEqual(None, self.tree.Root.LeftChild)
self.assertEqual(None, self.tree.Root.RightChild)
def test_delete_node_with_one_left_child(self):
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(12, 'key12')
self.tree.AddKeyValue(9, 'key9')
self.assertEqual(4, self.tree.Count())
self.tree.DeleteNodeByKey(12)
self.assertEqual(3, self.tree.Count())
self.assertEqual(1, self.tree.Root.NodeKey)
self.assertEqual(0, self.tree.Root.LeftChild.NodeKey)
self.assertEqual(9, self.tree.Root.RightChild.NodeKey)
self.assertEqual(1, self.tree.Root.RightChild.Parent.NodeKey)
def test_delete_node_with_one_right_child(self):
self.tree.AddKeyValue(-2, 'key-2')
self.tree.AddKeyValue(0, 'key0')
self.tree.AddKeyValue(12, 'key12')
self.assertEqual(4, self.tree.Count())
self.tree.DeleteNodeByKey(-2)
self.assertEqual(3, self.tree.Count())
self.assertEqual(1, self.tree.Root.NodeKey)
self.assertEqual(0, self.tree.Root.LeftChild.NodeKey)
self.assertEqual(12, self.tree.Root.RightChild.NodeKey)
self.assertEqual(1, self.tree.Root.RightChild.Parent.NodeKey)
def test_delete_node_with_both_child_no_right_leaf(self):
self.tree = BST(BSTNode(50, 'key50', None))
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(70, 'key70')
self.tree.AddKeyValue(10, 'key10')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(90, 'key90')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(45, 'key45')
self.assertEqual(9, self.tree.Count())
self.tree.DeleteNodeByKey(20)
self.assertEqual(8, self.tree.Count())
self.assertEqual(None, self.tree.FindNodeByKey(40).Node.LeftChild)
self.assertEqual(45, self.tree.FindNodeByKey(40).Node.RightChild.NodeKey)
def test_delete_node_with_both_child_with_right_leaf(self):
self.tree = BST(BSTNode(50, 'key50', None))
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(70, 'key70')
self.tree.AddKeyValue(10, 'key10')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(90, 'key90')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(35, 'key30')
self.tree.AddKeyValue(45, 'key45')
self.assertEqual(10, self.tree.Count())
self.tree.DeleteNodeByKey(20)
self.assertEqual(9, self.tree.Count())
self.assertEqual(35, self.tree.FindNodeByKey(40).Node.LeftChild.NodeKey)
self.assertEqual(45, self.tree.FindNodeByKey(40).Node.RightChild.NodeKey)
def test_delete_root_node_with_both_child(self):
self.tree = BST(BSTNode(50, 'key50', None))
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(70, 'key70')
self.tree.AddKeyValue(10, 'key10')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(90, 'key90')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(35, 'key30')
self.tree.AddKeyValue(45, 'key45')
self.assertEqual(10, self.tree.Count())
self.tree.DeleteNodeByKey(50)
self.assertEqual(9, self.tree.Count())
self.assertEqual(False, self.tree.FindNodeByKey(50).NodeHasKey)
self.assertEqual(60, self.tree.Root.NodeKey)
self.assertEqual(None, self.tree.Root.Parent)
self.assertEqual(20, self.tree.Root.LeftChild.NodeKey)
self.assertEqual(70, self.tree.Root.RightChild.NodeKey)
def test_another_one_deleting(self):
self.tree = BST(BSTNode(50, 'key50', None))
self.tree.AddKeyValue(20, 'key20')
self.tree.AddKeyValue(70, 'key70')
self.tree.AddKeyValue(10, 'key10')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(90, 'key90')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(35, 'key30')
self.tree.AddKeyValue(45, 'key45')
self.assertEqual(10, self.tree.Count())
self.tree.DeleteNodeByKey(10)
self.assertEqual(9, self.tree.Count())
def test_delete_empty_tree(self):
tree2 = BST(None)
self.assertEqual(0, tree2.Count())
self.assertEqual(False, tree2.DeleteNodeByKey(777))
def test_deep_all_nodes_postorder(self):
self.assertEqual([30, 37, 45, 40, 35, 57, 60, 55, 50],
[x.NodeKey for x in self.tree.DeepAllNodes(1)])
self.tree = BST(None)
self.assertEqual((), self.tree.DeepAllNodes(1))
class TestUM(unittest.TestCase):
def setUp(self):
# 50
# / \
# 35 55
# / \ \
# 30 40 60
# / \ /
# 37 45 57
self.parent_node = BSTNode(50, 'key50', None)
self.tree = BST(self.parent_node)
self.tree.AddKeyValue(35, 'key35')
self.tree.AddKeyValue(55, 'key55')
self.tree.AddKeyValue(30, 'key30')
self.tree.AddKeyValue(40, 'key40')
self.tree.AddKeyValue(60, 'key60')
self.tree.AddKeyValue(37, 'key37')
self.tree.AddKeyValue(45, 'key45')
self.tree.AddKeyValue(57, 'key57')
def test_wide_all_nodes(self):
self.assertEqual([50, 35, 55, 30, 40, 60, 37, 45, 57],
[x.NodeKey for x in self.tree.WideAllNodes()])
self.tree = BST(None)
self.assertEqual((), self.tree.WideAllNodes())
def test_deep_all_nodes_preorder(self):
self.assertEqual([50, 35, 30, 40, 37, 45, 55, 60, 57],
[x.NodeKey for x in self.tree.DeepAllNodes(2)])
self.tree = BST(None)
self.assertEqual((), self.tree.DeepAllNodes(2))
def test_deep_all_nodes_inorder(self):
self.assertEqual([30, 35, 37, 40, 45, 50, 55, 57, 60],
[x.NodeKey for x in self.tree.DeepAllNodes(0)])
self.tree = BST(None)
self.assertEqual((), self.tree.DeepAllNodes(0))
def test_deep_all_nodes_postorder(self):
self.assertEqual([30, 37, 45, 40, 35, 57, 60, 55, 50],
[x.NodeKey for x in self.tree.DeepAllNodes(1)])
self.tree = BST(None)
self.assertEqual((), self.tree.DeepAllNodes(1))
def test_deep_all_nodes_preorder(self):
self.assertEqual([50, 35, 30, 40, 37, 45, 55, 60, 57],
[x.NodeKey for x in self.tree.DeepAllNodes(2)])
self.tree = BST(None)
self.assertEqual((), self.tree.DeepAllNodes(2))
def test_wide_all_nodes(self):
self.assertEqual([50, 35, 55, 30, 40, 60, 37, 45, 57],
[x.NodeKey for x in self.tree.WideAllNodes()])
self.tree = BST(None)
self.assertEqual((), self.tree.WideAllNodes())