15-binary_tree_is_full.c

#include "binary_trees.h"

/**
 * check_full_recursive - Checks if a binary tree is full recursively.
 * @tree: A pointer to the root node of the tree to check.
 *
 * Return: If tree is Not Full Return 0.
 *		Otherwise Return 1.
 */

int check_full_recursive(const binary_tree_t *tree)
{
	if (tree == NULL)
		return (1);

	if ((tree->left != NULL && tree->right == NULL) ||
	    (tree->left == NULL && tree->right != NULL) ||
	    check_full_recursive(tree->left) == 0 ||
	    check_full_recursive(tree->right) == 0)
		return (0);

	return (1);
}

/**
 * binary_tree_is_full - Checks if a binary tree is full.
 * @tree: A pointer to the root node of the tree to check.
 *
 * Return: If tree is NULL or is Not Full Return 0.
 *		Otherwise 1.
 */
int binary_tree_is_full(const binary_tree_t *tree)
{
	if (tree == NULL)
		return (0);

	return (check_full_recursive(tree));
}