typedef struct _tree_root {
TREE_NODE *root;
int (*compare)(void* x, void *y);
- void (*free)(void *p);
+ void (*free_func)(void *p);
} SORTED_TREE;
#endif
ZERO_STRUCTP( tree );
tree->compare = cmp_fn;
- tree->free = free_fn;
+ tree->free_func = free_fn;
if ( !(tree->root = (TREE_NODE*)malloc( sizeof(TREE_NODE) )) ) {
SAFE_FREE( tree );
if ( tree->root )
sorted_tree_destroy_children( tree->root );
- if ( tree->free )
- tree->free( tree->root );
+ if ( tree->free_func )
+ tree->free_func( tree->root );
SAFE_FREE( tree );
}