红黑树C++实现
摘要:参考CLRS第二版(ch 13)#ifndef _C_RB_TREE_H_#define _C_RB_TREE_H_#define NULL 0template <class KeyT, class DataT>class RB_TREE{public: RB_TREE():root(NULL){} void Insert(KeyT key, DataT data = NULL) { rb_nodes *node, *tmp; node = root; tmp = NULL; while(node != NULL) { tmp = node; if(key<node->
阅读全文
posted @ 2011-02-23 21:29
浙公网安备 33010602011771号