Lines Matching refs:bl_left
14 while (node->bl_left)
15 node = node->bl_left;
50 node = node->bl_left;
102 node = node->bl_left;
123 parent->bl_left = node;
141 assert (node->bl_left == NULL && node->bl_right == NULL);
152 assert ((node->bl_left == NULL && node->bl_right != NULL) ||
153 (node->bl_left != NULL && node->bl_right == NULL));
155 if (node->bl_left)
159 node->tree->root = node->bl_left;
160 node->bl_left->parent = NULL;
164 node->parent->link[node->parent_link] = node->bl_left;
165 node->bl_left->parent = node->parent;
166 node->bl_left->parent_link = node->parent_link;
206 node = node->bl_left;
214 if (node->bl_left == NULL && node->bl_right == NULL)
222 if ((node->bl_left == NULL && node->bl_right != NULL) ||
223 (node->bl_left != NULL && node->bl_right == NULL))
231 if (node->bl_left != NULL && node->bl_right != NULL)
247 successor->bl_left = node->bl_left;
254 successor->bl_left->parent = successor;
283 node->bl_left = NULL;
292 node->bl_left = head->bl_left;
300 if (node->parent || node->bl_left || node->bl_right || node->data)
310 node->bl_left = node->parent->bl_left; \
330 node->bl_left = NULL;
367 node->bl_left = next->bl_left;
374 node->bl_left = NULL;
421 if (subroot->bl_left)
424 bintree_print_sub (print, subroot->bl_left);