随笔分类 -  平衡树

红黑树实现
摘要:/* * 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 龙豆 阅读(520) 评论(0) 推荐(1) 编辑

poj-2418 Hardwood Species *
摘要:/* * 二叉查找树练习 * 2418.cpp * * Created on: 2011-7-21 * Author: */#include <cstdio>#include <cstring>using namespace std;const int maxs = 10000 + 5;const int ROOT = 0;struct SData{ char name[35]; int num; SData *left, *right; SData(): num(0), left(NULL), right(NULL) {}};SData *tree[maxs];int 阅读全文

posted @ 2011-07-21 17:07 龙豆 阅读(312) 评论(0) 推荐(0) 编辑

导航

点击右上角即可分享
微信分享提示