def test_insertion_and_find_odd_degree(self):
btree = BTree(3)
for i in self.keys_to_insert:
btree.insert_key(i)
for i in range(100):
key = self.random.choice(self.keys_to_insert)
self.assertTrue(btree.find(key))
def test_insertion_and_find_odd_degree(self):
btree = BTree(3)
for i in self.keys_to_insert:
btree.insert_key(i)
for i in range(100):
key = self.random.choice(self.keys_to_insert)
self.assertTrue(btree.find(key))
def test_deletion_even_degree(self):
btree = BTree(4)
key_list = set(self.keys_to_insert)
for i in key_list:
btree.insert_key(i)
for key in key_list:
btree.remove_key(key)
self.assertFalse(btree.find(key))
self.assertEqual(btree.root.keys, [])
self.assertEqual(btree.root.children, [])
def test_deletion_odd_degree(self):
btree = BTree(3)
key_list = set(self.keys_to_insert)
for i in key_list:
btree.insert_key(i)
for key in key_list:
btree.remove_key(key)
self.assertFalse(btree.find(key))
self.assertEqual(btree.root.keys, [])
self.assertEqual(btree.root.children, [])