void rb_preorder(struct rb_t *tree,struct rb_node_t *node) { if(node) { tree->print(node); rb_preorder(tree,node->left); rb_preorder(tree,node->right); } }
void rb_preorder(struct rb_node *root, struct rb_node *sentinel) { if (root != sentinel) { rb_preorder(root->left, sentinel); printf("node %p parent %p left %p right %p color %d key %d\n", root, root->parent, root->left, root->right, root->color, root->key); rb_preorder(root->right, sentinel); } }