-
Notifications
You must be signed in to change notification settings - Fork 0
/
16-binary_tree_is_perfect.c
52 lines (50 loc) · 984 Bytes
/
16-binary_tree_is_perfect.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include "binary_trees.h"
/**
* tree_is_perfect - function that says if a tree is perfect or not
* it has to be the same quantity of levels in left as right, and also
* each node has to have 2 nodes or none
* @tree: tree to check
* Return: 0 if is not a perfect or other number that is the level of height
*/
int tree_is_perfect(const binary_tree_t *tree)
{
int l = 0, r = 0;
if (tree->left && tree->right)
{
l = 1 + tree_is_perfect(tree->left);
r = 1 + tree_is_perfect(tree->right);
if (r == l && r != 0 && l != 0)
return (r);
return (0);
}
else if (!tree->left && !tree->right)
{
return (1);
}
else
{
return (0);
}
}
/**
* binary_tree_is_perfect - perfect or not a tree
* @tree: tree to check
* Return: 1 is it is or 0 if not
*/
int binary_tree_is_perfect(const binary_tree_t *tree)
{
int result = 0;
if (tree == NULL)
{
return (0);
}
else
{
result = tree_is_perfect(tree);
if (result != 0)
{
return (1);
}
return (0);
}
}