How to implement a m way Btree in c

Answer 1

in insertion and splitting of nodes

Answer 2

typedef struct Node{
struct Node * left;
struct Node * right;
void * value;
}
typedef struct{
struct Node * root;
/* whatever information you need */
}BTree;

Answer 3

Oh, I did not know as we call it differently in French, sorry !

Answer 4

insertion : just go through the tree and add at the end
deletion : remove the value, add the right part at the old value's place and the left part at the bottom left of the right part