1 #ifndef BTREE_MEM_H_

2 #define BTREE_MEM_H_

3

4

5 struct btree_mem_node;

6

7 struct btree_mem

8 {

9 int mindeg;

10 struct btree_mem_node * root;

11 int (*cmp)(void *, void *);

12 };

13

14 struct btree_mem * btree_mem_new(int min_degree, int (*cmp)(void *, void *));

15 void btree_mem_delete(struct btree_mem * bt);

16

17 void * btree_mem_insert(struct btree_mem * bt, void * key, void * data);

18 void * btree_mem_find(struct btree_mem * bt, void * key);

19 void * btree_mem_remove(struct btree_mem * bt, void * key);

20

21 void btree_mem_walk_inorder(struct btree_mem * bt, void (*f)(int, void *, void *));

22

23 #endif