> 2 ex01: ft_btree_insert_data // Write recursive insert... // Submit Moulinette: KO (segfault) // Debug: forgot to malloc node // Resubmit Moulinette: OK (4/4)
> 1 (to start ex00)
// Handle special cases: INT_MIN, base 10, base 16, etc. // Recursive approach: // - Convert absolute value // - Build string from least significant digit // - Handle negative for base 10 42 Exam Rank 03
if (!node) return (NULL); if (cmp(node->item, ref) == 0) return (node->item); void *left = search(node->left, ref, cmp); if (left) return (left); return (search(node->right, ref, cmp)); > 2 ex01: ft_btree_insert_data // Write recursive insert