FilesExpand file tree

master

/

16-binary_tree_is_perfect.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

61 lines (47 loc) · 1.29 KB

master

/

16-binary_tree_is_perfect.c

Copy path

Top

File metadata and controls

• Code
• Blame

61 lines (47 loc) · 1.29 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include "binary_trees.h"

/**

* binary_tree_size - measures the size of a binary tree

* @tree: tree to measure the size of

*

* Return: size of the tree

* 0 if tree is NULL

**/

size_t binary_tree_size(const binary_tree_t *tree)

{

if (tree == NULL)

return (0);

return (binary_tree_size(tree->left) + binary_tree_size(tree->right) + 1);

}

/**

* binary_tree_height - measures the height of a binary tree

* @tree: tree to measure the height of

*

* Return: height of the tree 0 if tree is NULL

**/

size_t binary_tree_height(const binary_tree_t *tree)

{

size_t height_l = 0;

size_t height_r = 0;

if (!tree)

return (0);

height_l = tree->left ? 1 + binary_tree_height(tree->left) : 0;

height_r = tree->right ? 1 + binary_tree_height(tree->right) : 0;

return (height_l > height_r ? height_l : height_r);

}

/**

* binary_tree_is_perfect - checks if a binary tree is perfect

* @tree: pointer to the root node of the tree to be checked

* Return: 1 if tree is perfect, 0 íf tree is null and not perfect

*/

int binary_tree_is_perfect(const binary_tree_t *tree)

{

size_t height = 0, perfect_size = 0;

if (tree == NULL)

return (0);

height = binary_tree_height(tree);

perfect_size = (1 << (height + 1)) - 1;

if (perfect_size == binary_tree_size(tree))

return (1);

else

return (0);

}