8-binary_tree_postorder.c

#include "binary_trees.h"

/**
 * binary_tree_postorder - Entry point
 * Description: 'Traverses a binary tree using post-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_postorder(const binary_tree_t *tree, void (*func)(int))
{
	if (tree && func)
	{
		binary_tree_postorder(tree->left, func);
		binary_tree_postorder(tree->right, func);
		func(tree->n);
	} /* end if */
} /* End function */