// TODO(nasr):
// 1. splitting the tree when getting too big? (horizontally)
// 2. joining trees?


internal void
b_tree_create(mem_arena *arena, u16 order)
{


}

// NOTE(nasr): nodes that get  passed as parameters should've already been loaded into memory
internal void
b_tree_search(node *node)
{


}

internal void
b_tree_insert()
{

}

internal void
b_tree_write()
{
    // TODO(nasr): write the b_tree to disk
}