Lines Matching refs:bl_right
26 while (node->bl_right)
27 node = node->bl_right;
52 node = node->bl_right;
104 node = node->bl_right;
128 parent->bl_right = 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));
169 else if (node->bl_right)
173 node->tree->root = node->bl_right;
174 node->bl_right->parent = NULL;
178 node->parent->link[node->parent_link] = node->bl_right;
179 node->bl_right->parent = node->parent;
180 node->bl_right->parent_link = node->parent_link;
208 node = node->bl_right;
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)
236 successor = bintree_lookup_node_min (node->bl_right);
239 if (successor->bl_right)
248 successor->bl_right = node->bl_right;
250 /* if the successor was the node->bl_right itself,
251 bintree_remove_**child may touch node->bl_right,
252 so only the successor->bl_right may be NULL
255 if (successor->bl_right)
256 successor->bl_right->parent = successor;
284 node->bl_right = NULL;
293 node->bl_right = head->bl_right;
300 if (node->parent || node->bl_left || node->bl_right || node->data)
306 while (node->parent && node->parent->bl_right && \
307 node->parent->bl_right->data == node->data) \
311 node->bl_right = node->parent->bl_right; \
331 node->bl_right = NULL;
353 if (node->bl_right)
354 next = bintree_lookup_node_min (node->bl_right);
368 node->bl_right = next->bl_right;
375 node->bl_right = NULL;
412 if (subroot->bl_right)
415 bintree_print_sub (print, subroot->bl_right);