Загвоздка с деревом, динамические структуры данных - C (СИ)

void tree_insert(
   node* root,
   int x
);

void tree_print(
   node* root
);

void tree_remove(
   node* root,
   int x
);

void tree_erase (
   node* root
);

#include <stdio.h>
 
#include <stdlib.h>
 
struct node {
    int data;
    struct node * next;
};
 
void CreateList(node * list) {
    list->next=NULL;
};
 
void list_insert(node *list, int x) {
    node *uzel;
 
    if (list->next == NULL) {
 
        list->next = (node *) malloc(sizeof(uzel));
        list->next->data = x;
        list->next->next = NULL;
        return;
 
    };
 
    if (list->next->data >= x) {
 
        uzel = (node *) malloc(sizeof(uzel));
        uzel->data = x;
        uzel->next = list->next;
        list->next = uzel;
 
    } else {
        list_insert(list->next, x);
    }
};
 
void list_remove(node *list, int x) {
 
    node * tmp;
 
    if(list->next->data == x) {
 
        tmp = list->next->next;
        free(list->next);
        list->next = tmp;
 
    } else {
        list_remove(list->next, x);
    }
};
 
void list_erase(node *list){
    node * tmp;
 
    tmp = list->next;
    int ms[100]={0};
    int ix=0;
    while(tmp !=NULL) {
        node* next=tmp->next;
        free(tmp);
        tmp=next;
    }
    list->next=NULL;
 
}
 
void list_print(node *list) {
    node * tmp;
    if(list->next == NULL)  {
        printf("List is empty");
        return;
    }
 
    tmp = list->next;
    while(tmp !=NULL) {
        printf("%d ",tmp->data);
        tmp=tmp->next;
    };
};
 
int difference(node *list) {
    int i = 0 ;
    node * tmp = list;
 
    int max=tmp->next->data;
    int min=tmp->next->data;
 
    while(tmp->next != NULL) {
        if(tmp->next->data >max){
            max=tmp->next->data;
        }
        if(tmp->data <min){
            min=tmp->data;
        }
 
        i++;
        tmp=tmp->next;
    };
    return max-min;
};
 
int main () {
 
    node list;
    CreateList(&list);
    int i=0;
    while(i<15){
        list_insert(&list, rand() % 111);
        i++;
    }
    printf("\nPrinting all of the elements....\n");
    list_print(&list);
 
    list_remove(&list, 7);
    list_remove(&list, 41);
    list_remove(&list, 44);
    list_remove(&list, 54);
    list_remove(&list, 62);
 
    printf("\n\nPrinting all of the elements after removing 5 of them....\n");
    list_print(&list);
    
    printf("\n\nThe difference between maximum and minimum : %d\n", difference(&list));
 
    return 0;
};