> 2 Available exercises: ex00: ft_list_size (2 pts) ex01: ft_btree_insert_data (4 pts) ex02: ft_itoa_base (4 pts)
typedef struct s_queue
Do not use recursion here — unnecessary and slower. 2. ft_list_remove_if (Medium) void ft_list_remove_if(t_list **begin_list, void *data_ref, int (*cmp)()) 42 Exam Rank 03
> 3 ex00? y Submitted. Moulinette: OK (2/2) > 2 Available exercises: ex00: ft_list_size (2 pts)
void *search(t_btree *node, void *ref, int (*cmp)()) int (*cmp)()) >