// remove from front
int count = 0; while (begin_list) count++; begin_list = begin_list->next; return (count); 42 Exam Rank 03
if (!node) return (ft_btree_create_node(item)); if (cmp(item, node->item) < 0) node->left = insert(node->left, item, cmp); else node->right = insert(node->right, item, cmp); return (node); // remove from front int count = 0;