Let me show it here:

node->is_done = (int *) malloc(sizeof(int));
node->hood = (double *) malloc(sizeof(double));
node->c = (int *) malloc(sizeof(int));
node->site = (double *) malloc(sizeof(double));
node->site2 = (double *) malloc(sizeof(double));double
node->des = (double *) malloc(sizeof(double));
node->asc = (double *) malloc(sizeof(double));

//null checking

node->is_done = 0;
node->hood = 0;
node->c = 1;
node->site = 0;
node->site2 = 0;
node->des = 0;
node->asc = 0

But, use of these varialbes in code will lead to segfaults, e.g. if(node->is_done) { --- }

check these varialbes, those showing 'address 0x1cd00000103 out of bounds' will finally lead to segments

I should remind that some nodes but not all the nodes in a tree will give segfaults when checking if(node->is_done)

It is said that unsuccessful initialization is the source of 'Address 0x1cd00000103 out of bounds'. Concretely speaking, how to avoid such unsuccessful initialization occur in some nodes?

Can we take some measures?