|  line  | 
 true  | 
 false  | 
 branch  | 
 
| 
32
 | 
 0  | 
 0  | 
     if(avl_tree->mc_nodes == NULL)  | 
 
| 
36
 | 
 0  | 
 0  | 
     if(mycore_status)  | 
 
| 
49
 | 
 0  | 
 0  | 
     if(avl_tree == NULL)  | 
 
| 
54
 | 
 0  | 
 0  | 
     if(self_destroy) {  | 
 
| 
80
 | 
 0  | 
 0  | 
     return (node ? node->height : 0);  | 
 
| 
102
 | 
 0  | 
 0  | 
     if(node->right)  | 
 
| 
122
 | 
 0  | 
 0  | 
     if(node->left)  | 
 
| 
148
 | 
 0  | 
 0  | 
             if(mycore_utils_avl_tree_node_balance_factor(node->right) < 0)  | 
 
| 
153
 | 
 0  | 
 0  | 
             if(parent) {  | 
 
| 
154
 | 
 0  | 
 0  | 
                 if(parent->right == node)  | 
 
| 
163
 | 
 0  | 
 0  | 
             if(mycore_utils_avl_tree_node_balance_factor(node->left) > 0)  | 
 
| 
168
 | 
 0  | 
 0  | 
             if(parent) {  | 
 
| 
169
 | 
 0  | 
 0  | 
                 if(parent->right == node)  | 
 
| 
181
 | 
 0  | 
 0  | 
     if(node->parent == NULL)  | 
 
| 
189
 | 
 0  | 
 0  | 
     if(*root == NULL) {  | 
 
| 
200
 | 
 0  | 
 0  | 
         if(type == node->type) {  | 
 
| 
204
 | 
 0  | 
 0  | 
         else if(type < node->type) {  | 
 
| 
205
 | 
 0  | 
 0  | 
             if(node->left == NULL) {  | 
 
| 
219
 | 
 0  | 
 0  | 
             if(node->right == NULL) {  | 
 
| 
234
 | 
 0  | 
 0  | 
     while(node) {  | 
 
| 
241
 | 
 0  | 
 0  | 
     if(node == NULL)  | 
 
| 
244
 | 
 0  | 
 0  | 
     while(node->right) {  | 
 
| 
255
 | 
 0  | 
 0  | 
     if(node) {  | 
 
| 
256
 | 
 0  | 
 0  | 
         if(delete_node->left == node) {  | 
 
| 
257
 | 
 0  | 
 0  | 
             balance_node = node->left ? node->left : node;  | 
 
| 
262
 | 
 0  | 
 0  | 
             if(delete_node->right)  | 
 
| 
273
 | 
 0  | 
 0  | 
             if(delete_node->left)  | 
 
| 
275
 | 
 0  | 
 0  | 
             if(delete_node->right)  | 
 
| 
279
 | 
 0  | 
 0  | 
         if(delete_node->parent) {  | 
 
| 
280
 | 
 0  | 
 0  | 
             if(delete_node->parent->left == delete_node) { delete_node->parent->left = node; }  | 
 
| 
290
 | 
 0  | 
 0  | 
         if(delete_node->parent) {  | 
 
| 
291
 | 
 0  | 
 0  | 
             if(delete_node->parent->left == delete_node) { delete_node->parent->left = delete_node->right; }  | 
 
| 
299
 | 
 0  | 
 0  | 
     while(balance_node) {  | 
 
| 
308
 | 
 0  | 
 0  | 
     while(node)  | 
 
| 
310
 | 
 0  | 
 0  | 
         if(type == node->type) {  | 
 
| 
318
 | 
 0  | 
 0  | 
         else if(type < node->type)  | 
 
| 
329
 | 
 0  | 
 0  | 
     while(node)  | 
 
| 
331
 | 
 0  | 
 0  | 
         if(type == node->type)  | 
 
| 
333
 | 
 0  | 
 0  | 
         else if(type < node->type)  | 
 
| 
344
 | 
 0  | 
 0  | 
     if(root == NULL)  |