红黑树3

demo.c

#include
#include
#include "rbtree.h"
int main(int argc, char *argv[])
{
    int i;
    struct rb_root root;
    root.rb_node = NULL;
    for (i = 2; i < argc; i++ ) {
        struct rb_key rb_key;
        rb_key.key = atol(argv[i]);
        struct rb_node *node = rb_newnode(&rb_key);
        if (node) {
            rb_insert(node, &root);
        }
    }
    rb_traverse(root.rb_node);
    printf("/n");
    struct rb_key rb_key;
    rb_key.key = atol(argv[1]);
    struct rb_node *node = rb_search(&root, rb_key);
    if (node) {
        printf("key = %d/n", node->rb_key.key);
        rb_erase(node, &root);
        rb_traverse(root.rb_node);
        printf("/n");
    } else {
        printf("%d is not found/n", rb_key.key);
    }
    return 0;
}

参考文献：

[1] 算法导论

[2] 一篇讨论红黑树的好文章: