7-binary_tree_inorder.c

#include "binary_trees.h"

/**
 * binary_tree_inorder - Entry point
 * Description: 'Goes through a binary tree using in-order traversal.'
 * @tree: A pointer to the root node of the tree to traverse.
 * @func: A pointer to a function to call for each node.
 */
void binary_tree_inorder(const binary_tree_t *tree, void (*func)(int))
{
	if (tree && func)
	{
		binary_tree_inorder(tree->left, func);
		func(tree->n);
		binary_tree_inorder(tree->right, func);
	} /* end if */
} /* end function */