-
Notifications
You must be signed in to change notification settings - Fork 0
/
16-binary_tree_is_perfect.c
93 lines (78 loc) · 1.68 KB
/
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include "binary_trees.h"
size_t sizet(const binary_tree_t *tree, size_t _size);
size_t binary_tree_height(const binary_tree_t *tree);
int pot(int numero, int potencia);
/**
* binary_tree_is_perfect - function that checks if a binary tree is perfect
*
* @tree: is a pointer to the root node of the tree to check
*
* Return: value indicator true or false
*/
int binary_tree_is_perfect(const binary_tree_t *tree)
{
int height, t_n = 0, size;
if (!tree)
return (0);
height = (int)binary_tree_height(tree);
size = (int)sizet(tree, 0);
while (height >= 0)
{
t_n = t_n + pot(2, height);
height--;
}
if (t_n == size)
return (1);
return (0);
}
/**
* binary_tree_height - Function that measures the height of a binary tree
* @tree: Pointer to the root node of the tree to measure the height
* Return: If tree is NULL, your function must return 0
*/
size_t binary_tree_height(const binary_tree_t *tree)
{
size_t r, l;
if (!tree || (tree->left == NULL && tree->right == NULL))
return (0);
l = binary_tree_height(tree->left);
r = binary_tree_height(tree->right);
if (l > r)
return (l + 1);
else
return (r + 1);
}
/**
* sizet - recursive function
* @tree: root node
* @_size: node counter
* Return: number of nodes + 1
*/
size_t sizet(const binary_tree_t *tree, size_t _size)
{
if (tree != NULL)
{
_size = sizet(tree->left, _size) + sizet(tree->right, _size);
}
else
{
_size++;
}
return (_size);
}
/**
* pot - pow functions
* @numero: number to pow
* @potencia: pow number
* Return: int value
*/
int pot(int numero, int potencia)
{
int resultado = numero;
while (potencia > 1)
{
resultado = resultado * numero;
potencia--;
}
return (resultado);
}