8-binary_tree_postorder.c

#include "binary_trees.h"

/**
 * binary_tree_postorder - goes through a binary tree using
 * post-order traversal
 * @tree: Pointer to the root node of the tree to traverse
 * @func: Pointer to a function to call for each node
 *
 * Return: Nothing
 */

void binary_tree_postorder(const binary_tree_t *tree, void (*func)(int))
{
	if (!tree || !func)
		return;

	/* go left */
	binary_tree_postorder(tree->left, func);

	/* go right */
	binary_tree_postorder(tree->right, func);

	func(tree->n);
}