FilesExpand file tree

master

/

7-binary_tree_inorder.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

executable file

·

20 lines (20 loc) · 490 Bytes

master

/

7-binary_tree_inorder.c

Copy path

Top

File metadata and controls

• Code
• Blame

executable file

·

20 lines (20 loc) · 490 Bytes

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

#include "binary_trees.h"

/**

* binary_tree_inorder - a function that goes

* through a binary tree using in-order traversal

*

* @tree: a pointer to the root node of the tree to traverse

* @func: a pointer to a function to call for each node

*

* Return: nothing 😂😂

*/

void binary_tree_inorder(const binary_tree_t *tree, void (*func)(int))

{

if (!tree || !func)

{

return;

}

binary_tree_inorder(tree->left, func);

func(tree->n);

binary_tree_inorder(tree->right, func);

}