}else{
printf(" nil-%d",t->left->color);
}
if(t->right != rb_nil){
printf(" %d-%d",t->right->key.value,t->right->color);
}else{
printf(" nil-%d",t->right->color);
}
printf("\n");
rbtree_print(t->left);
rbtree_print(t->right);
}
红黑树源码实现 (三)
printf(" %d-%d",t->left->key.value,t->left->color);
}else{
printf(" nil-%d",t->left->color);
}
if(t->right != rb_nil){
printf(" %d-%d",t->right->key.value,t->right->color);
}else{
printf(" nil-%d",t->right->color);
}
printf("\n");
rbtree_print(t->left);
rbtree_print(t->right);
}
}else{
printf(" nil-%d",t->left->color);
}
if(t->right != rb_nil){
printf(" %d-%d",t->right->key.value,t->right->color);
}else{
printf(" nil-%d",t->right->color);
}
printf("\n");
rbtree_print(t->left);
rbtree_print(t->right);
}