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);
> 1 (to start ex00)
Total: 10/8. PASS.
t_list *current = *begin_list; t_list *previous = NULL; while (current) 42 Exam Rank 03
Good luck, and may your pointers never be dangling! if (!node) return (ft_btree_create_node(item))
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);
> 1 (to start ex00)
Total: 10/8. PASS.
t_list *current = *begin_list; t_list *previous = NULL; while (current)
Good luck, and may your pointers never be dangling!