16-binary_tree_is_perfect.c

#include "binary_trees.h"

/**
 * tree_stats - computes some statistics about a binary tree.
 * @tree: pointer to the root node of the tree.
 * @n: accumulated height of the current path in the tree.
 * @leaves: pointer to tree's leaf count.
 * @height: pointer to tree's maximum height.
 *
 * Return: void
 */

void tree_stats(const binary_tree_t *tree, size_t n,
		size_t *leaves, size_t *height)
{
	if (tree != NULL)
	{
		if ((tree->left == NULL) && (tree->right == NULL))
		{
			if (leaves != NULL)
				(*leaves)++;
			if ((height != NULL) && (n > *height))
				*height = n;
		}
		else
		{
			tree_stats(tree->left, n + 1, leaves, height);
			tree_stats(tree->right, n + 1, leaves, height);
		}
	}
}
/**
 * binary_tree_is_perfect - checks if a binary tree is perfect
 * @tree: pointer to the root node of the tree to check
 * Return: 1 if perfect
 *         0 if not perfect or tree is NULL
 */

int binary_tree_is_perfect(const binary_tree_t *tree)
{
	size_t leaves_count = 0;
	size_t tree_height = 0;

	tree_stats(tree, 0, &leaves_count, &tree_height);

	/**
	 * can also be written with one if statment
	 *
	 * return ((int)leaves_count == (1 << tree_height) ? 1 : 0);
	 */
	if ((int)leaves_count == (1 << tree_height))
		return (1);
	return (0);

}