def test_split_balances_parents_parent(self):
# k = 5 and input values 1..5
k = 5
input_node = BNode([3, 6, 9, 12])
a = BNode([1, 2])
b = BNode([4, 5])
c = BNode([7, 8])
d = BNode([10, 11])
e = BNode([13, 14, 15, 16])
a.is_leaf = True
b.is_leaf = True
b.is_leaf = True
c.is_leaf = True
d.is_leaf = True
e.is_leaf = True
input_node.add_child(a, b, c, d, e)
tree = BTree(k)
tree._split(17, e)
result = tree.get_root()
self.assertTrue(len(result.keys) == 1)
self.assertTrue(result.keys == [9])
first_child_layer = result.children
self.assertTrue(len(first_child_layer) == 2)
self.assertTrue(first_child_layer[0].keys == [3, 6])
self.assertTrue(first_child_layer[1].keys == [12, 15])
for i in first_child_layer:
self.assertFalse(i.is_leaf)
# first 3 leafs
self.assertEquals([1, 2], first_child_layer[0].children[0].keys)
self.assertEquals([4, 5], first_child_layer[0].children[1].keys)
self.assertEquals([7, 8], first_child_layer[0].children[2].keys)
self.assertEquals(True, first_child_layer[0].children[0].is_leaf)
self.assertEquals(True, first_child_layer[0].children[1].is_leaf)
self.assertEquals(True, first_child_layer[0].children[2].is_leaf)
# last 3 leafs
self.assertEquals([10, 11], first_child_layer[1].children[0].keys)
self.assertEquals([13, 14], first_child_layer[1].children[1].keys)
self.assertEquals([16, 17], first_child_layer[1].children[2].keys)
self.assertEquals(True, first_child_layer[1].children[0].is_leaf)
self.assertEquals(True, first_child_layer[1].children[1].is_leaf)
self.assertEquals(True, first_child_layer[1].children[2].is_leaf)
def test_split_happens_as_expected(self):
# k = 3 and input values 1..3
k = 3
expected_output = BNode([1])
a = BNode([0])
b = BNode([2])
a.is_leaf = True
b.is_leaf = True
expected_output.add_child(a)
expected_output.add_child(b)
input_node = BNode([0, 1])
tree = BTree(k)
result = tree._split(2, input_node)
self.assertTrue(result.keys, [1])
self.assertEqual(len(result.children), 2)
self.assertEqual(result.children[0].keys, [0])
self.assertEqual(result.children[1].keys, [2])
def test_split_happens_as_expected_part_2(self):
# k = 5 and input values 1..5
k = 5
expected_output = BNode([3])
a = BNode([1, 2])
b = BNode([4, 5])
a.is_leaf = True
b.is_leaf = True
expected_output.add_child(a)
expected_output.add_child(b)
tree = BTree(k)
input_node = BNode([1, 2, 3, 4])
result = tree._split(5, input_node)
print(f'5 Values: {result}')
self.assertTrue(result.keys, [3])
self.assertEqual(len(result.children), 2)
self.assertEqual(result.children[0].keys, [1, 2])
self.assertEqual(result.children[1].keys, [4, 5])
tree.insert(6, result)
print(f'{tree.get_root()}')