int count = 0; while (begin_list) count++; begin_list = begin_list->next; return (count);
// remove from front
if (!root) return (0); return (1 + max(ft_btree_level_count(root->left), ft_btree_level_count(root->right))); 42 Exam Rank 03
struct s_btree *left; struct s_btree *right; void *item; t_btree; int count = 0; while (begin_list) count++; begin_list
// add to end