-void avl_insert_after(avl_tree_t * tree, avl_node_t * after, avl_node_t * node)
-{
- if(!after)
- return tree->head ? avl_insert_before(tree, tree->head,
- node) : avl_insert_top(tree,
- node);
+void avl_insert_after(avl_tree_t *tree, avl_node_t *after, avl_node_t *node) {
+ if(!after) {
+ if(tree->head)
+ avl_insert_before(tree, tree->head, node);
+ else
+ avl_insert_top(tree, node);
+ return;
+ }