42 Exam Rank 03 ⭐

struct s_list *next; void *data; t_list; typedef struct s_btree

// remove from front

Use pointer to pointer root to modify the tree when inserting at root or child. 5. ft_btree_apply_by_level (Most difficult in Rank 03) This requires a queue (FIFO) or recursion with level tracking. Since you can't use external libs, you must implement a simple queue using a linked list or array. 42 Exam Rank 03

struct s_btree *left; struct s_btree *right; void *item; t_btree;

if (!root) return (0); return (1 + max(ft_btree_level_count(root->left), ft_btree_level_count(root->right))); struct s_list *next; void *data; t_list; typedef struct

int max(int a, int b) return (a > b ? a : b); int ft_btree_level_count(t_btree *root)

int count = 0; while (begin_list) count++; begin_list = begin_list->next; return (count); Since you can't use external libs, you must

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