static inline TreeNode **search(TreeNode **node, void *key, Comparator cmp)
{
- if (! *node)
+ if (!*node)
return node;
int rel = cmp((*node)->dat, key);
static inline void traverse(TreeNode *node, Iterator iter, void *arg, Transformer trans, TreeTraversionOrder order, int delete)
{
- if (! node)
+ if (!node)
return;
if (iter && order == TRAVERSION_PREORDER ) iter(trans ? trans(node->dat) : node->dat, arg);