红黑树实现
摘要:/* * RED-BLACK-TREE * */#include <cstdio>using namespace std;const int MAXN = 10000;const int RED = 0, BLACK = 1, ROOT = 0;struct SData{ int key, color; SData *left, *right, *p;};SData *rbtree[MAXN];SData *nil = new SData;void ini(){ nil->color = BLACK; rbtree[ROOT] = nil;}SData *rb_minimum
阅读全文
posted @ 2011-07-21 21:37