class Splay_Tree_Test_Tree_Structure_After_Delete_With_Inorder_Traversal(
unittest.TestCase):
'''
The purpose of this test is to make sure that the splay op does not ruin the tree. So after each insert we check the
tree structure.
'''
def setUp(self):
self._splaytree = SplayTree()
self._splaytree.insert(key=5, obj=5)
self._splaytree.insert(key=8, obj=8)
self._splaytree.insert(key=7, obj=7)
self._splaytree.insert(key=9, obj=9)
self._splaytree.insert(key=10, obj=10)
self._splaytree.insert(key=2, obj=2)
self._splaytree.insert(key=1, obj=1)
self._splaytree.insert(key=3, obj=3)
self._splaytree.insert(key=4, obj=4)
self._splaytree.insert(key=6, obj=6)
def test_tree_structure_after_each_delete_with_inorder_traversal(self):
expected_inorder_list = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
inorder_from_tree = []
for i in range(1, 11): # 1 to 10
self._splaytree.remove(i)
for key, element in self._splaytree.traversal(want_in_order=True):
inorder_from_tree.append(element)
self.assertEqual(inorder_from_tree, expected_inorder_list[i:10],
'Tree ruined during insert splays')
inorder_from_tree = []
def tearDown(self):
self._splaytree = None
class SplayedHashBucket(collections.MutableMapping):
'''
A hash bucket is used to hold objects that hash to the same value in a hash table.
This is hash bucket using a splay tree. This masquerades as a python dict in code
where it is used. Since splat tree is used lookups on avg take Olog(n)
Note: HASHBUCKET ITERATION YIELDS KEYS. not the key value pairs in the bucket.
'''
def __init__(self):
self._st = SplayTree()
def __len__(self):
return self._st.node_count
def get(self, key, default = None):
'''
Get object associated with a key and on key miss return specified default. This is
there in Python dict and this class masquerades as dict, we implement it.
'''
try:
value = self[key]
return value
except KeyError:
return default
def __getitem__(self, key):
value = self._st.find(key)
if value == None:
raise KeyError('Key Error: %s ' % repr(key))
return value
def __delitem__(self, key):
if key in self._st:
self._st.remove(key)
else:
raise KeyError('Key Error: %s ' % repr(key))
def __setitem__(self, key, obj):
if key in self._st:
self._st.replace(key, obj)
else:
self._st.insert(key, obj)
def __iter__(self):
for key, value in self._st.inorder_traversal_with_stack():
yield key
class Splay_Tree_Test_Empty_Tree(unittest.TestCase):
def setUp(self):
self._splaytree = SplayTree()
def test_node_count_of_empty_tree(self):
self.assertEqual(self._splaytree.node_count, 0,
'Empty tree node count must be 0')
def test_find_key_empty_tree(self):
self.assertEqual(self._splaytree.find(20), None,
'Empty tree find operation must return None')
def test_delete_element_empty_tree(self):
self._splaytree.remove(20)
def tearDown(self):
self._splaytree = None
class Splay_Tree_Test_Tree_With_1_Element(unittest.TestCase):
def setUp(self):
self._splaytree = SplayTree()
self._splaytree.insert(key=10, obj=10)
def test_node_count_of_tree_with_1_node(self):
self.assertEqual(self._splaytree.node_count, 1,
'Tree node count must be 1')
def test_find_key_of_tree_with_1_node(self):
self.assertEqual(self._splaytree.find(10), 10,
'Find operation failed on tree with 1 node')
def test_delete_element_of_tree_with_1_node(self):
self._splaytree.remove(10)
self.assertEqual(self._splaytree.node_count, 0,
'Empty tree node count must be 0')
self.assertEqual(self._splaytree.find(20), None,
'Empty tree find operation must return None')
def tearDown(self):
self._splaytree = None
class Splay_Tree_Test_Tree_Delete_Element_With_10_Elements(unittest.TestCase):
def setUp(self):
self._splaytree = SplayTree()
self._splaytree.insert(key=5, obj=5)
self._splaytree.insert(key=8, obj=8)
self._splaytree.insert(key=7, obj=7)
self._splaytree.insert(key=9, obj=9)
self._splaytree.insert(key=10, obj=10)
self._splaytree.insert(key=2, obj=2)
self._splaytree.insert(key=1, obj=1)
self._splaytree.insert(key=3, obj=3)
self._splaytree.insert(key=4, obj=4)
self._splaytree.insert(key=6, obj=6)
self._splay_tree_node_count = 10
def test_delete_element_of_tree_non_existing_element(self):
self._splaytree.remove(11)
self.assertEqual(self._splaytree.node_count,
self._splay_tree_node_count,
'Tree node count must be 10')
def test_delete_element_of_tree_with_10_node(self):
elements_to_delete = [10, 1, 7, 3, 5, 8, 2, 6, 9]
for element in elements_to_delete:
self._splaytree.remove(element)
self.assertEqual(self._splaytree.find(element), None,
'Element found in BST after deleting it!')
self._splay_tree_node_count = self._splay_tree_node_count - 1
self.assertEqual(self._splaytree.node_count,
self._splay_tree_node_count,
'Tree node count must tally after deletion')
def tearDown(self):
self._splaytree = None
traversed.append((key, value))
print('Tree inorder traversal (key, value) pairs:')
print(traversed)
if __name__ == '__main__':
bst = SplayTree()
print('Node count is %s' % str(bst.node_count))
print('Adding key value pairs (1, 1), (2, 2), .... (6, 6)')
kvpairs = [(5, 5), (2, 2), (7, 7), (1, 1), (3, 3), (9, 9), (8, 8), (4, 4),
(6, 6)]
for kvpair in kvpairs:
bst.insert(key=kvpair[0], obj=kvpair[1])
print_tree_inorder(bst)
print_tree_preorder(bst)
print_tree_postorder(bst)
#remove
element_to_remove = 9
print('removing element %s' % str(element_to_remove))
bst.remove(key=element_to_remove)
print_tree_inorder_using_stack(bst)
#replace obj for a key
key_to_replace = 1
new_object_for_Key = 111
bst.replace(key=key_to_replace, obj=new_object_for_Key)
print_tree_inorder_using_stack(bst)