int btree_level_count(t_btree *root) { if (!root) return (0); return (ft_max(btree_level_count(root->left), btree_level_count(root->right)) + 1); }
int btree_level_count(t_btree *root) { if (root == NULL || (root->left == NULL && root->right == NULL)) { return (0); } return (max(btree_level_count(root->left), btree_level_count(root->right)) + 1); }