7-binary_tree_inorder.c

#include "binary_trees.h"

/**
 * binary_tree_inorder - goes through a binary tree using in-order traversa
 * @tree: pointer to the root node of the tree to traverse
 * @func: pointer to a function to call for each node
 * If tree or func is NULL, do nothing
 **/

void binary_tree_inorder(const binary_tree_t *tree, void (*func)(int))
{
	/* in order: left, root, right */
	if (tree && func)
	{
		binary_tree_inorder(tree->left, func);
		func(tree->n);
		binary_tree_inorder(tree->right, func);
	}
}