Linked list for leaf nodes

src/bptree.c

@@ -154,7 +154,12 @@ static uint64_t split_leaf(BPTreeNode *node, uint64_t key, uint64_t data, BPTree
         IntegerArray_insert_at_index((*right_node)->data, insertion_index, data);
     }
 
-    // TODO : Linked List
+    if (node->children->size == 0) {
+        BPTreeNodeArray_append(node->children, *right_node);
+    } else {
+        BPTreeNodeArray_append((*right_node)->children, node->children->items[0]);
+        node->children->items[0] = *right_node;
+    }
 
     return median_value;
 }

src/main.c

@@ -50,6 +50,7 @@ void append_record(Directory *directory) {
 
 void search_record(Directory *directory) {
     printf("Enter the phone number that corresponds to the record you are looking for: ");
+    // TODO : crash phone number overflow
     char phone_number[11];
     scanf("%s", phone_number);
     clear_buffer();