struct rb_node *old = node, *left;
node = node->rb_right;
- while ((left = node->rb_left))
+ while ((left = node->rb_left) != NULL)
node = left;
child = node->rb_right;
parent = node->rb_parent;
n = root->rb_node;
if (!n)
- return 0;
+ return NULL;
while (n->rb_left)
n = n->rb_left;
return n;