42 Exam Rank 03 -

> 2 ex01: ft_btree_insert_data // Write recursive insert... // Submit Moulinette: KO (segfault) // Debug: forgot to malloc node // Resubmit Moulinette: OK (4/4)

Total: 10/8. PASS.

// Code in /rendu/ex00/ft_list_size.c // Test locally with a main (not submitted) // Submit 42 Exam Rank 03

t_btree *insert(t_btree *node, void *item, int (*cmp)())

if (!node) return; // do something with node traverse(node->left); traverse(node->right); > 2 ex01: ft_btree_insert_data // Write recursive insert

if (cmp(current->data, data_ref) == 0) if (previous) previous->next = current->next; else *begin_list = current->next; free(current); current = previous ? previous->next : *begin_list; else previous = current; current = current->next;

// add to end

> 3 ex00? y Submitted. Moulinette: OK (2/2)

struct s_list *next; void *data; t_list; typedef struct s_btree int (*cmp)()) if (!node) return