红黑树C++模板和仿函数实现

                                                               红黑树C++模板和仿函数实现1、红黑树暗地里和程序员打交道，比如set、map，这里就包括了很多语言如C++/Java/C#等OOP Language都包含实现它的代码，看了会STL源码中的红黑树，感觉要学的知识太多，很杂乱，六大组件，红黑树实现中要用到了常用的继承、迭代器等技术。

 

 

2、红黑树理论主要有(1)红黑树定义(2)插入算法(3)删除算法
    (1)红黑树定义
    (2)插入算法
    (3)删除算法

理论部分确实需要好好总结，我有时间会写一个pdf文件概况之！～

 

3、 实现

 

 1)、Global.h

该文件中只定义一个类型，用于定义记录红黑树中节点的个数以及每个节点key的插入次数，代码见附件

(2)、RbTree.h

该文件是红黑树的主要实现文件，主要功能有插入、删除、最大值、最小值、节点前驱、节点后继、搜索等。而主要难点就是插入跟删除两大块。

 

 

/* * RbTree.h * * Created on: 2010-12-29 * Author: Bill Lee HuNan University */ #ifndef RBTREE_H_ #define RBTREE_H_ #include "Global.h" #include <iostream> namespace bill { typedef enum _rb_color { RB_RED = false, RB_BLACK = true } rb_color; /* RedBlack Tree Node Base */ /* resolve nil variable */ struct _rb_tree_node_base; /* * global variable * but initialize in RbTree constructor * and destroy it in RbTree DeStructor */ _rb_tree_node_base* nil; struct _rb_tree_node_base { typedef _rb_tree_node_base* base_ptr; base_ptr parent; base_ptr left; base_ptr right; rb_color color; /* search the minimum key */ static base_ptr minimum(base_ptr x) { while(x->left != nil) x = x->left; return x; } /* search the maximum key */ static base_ptr maximum(base_ptr x) { while(x->right != nil) x = x->right; return x; } /* find the successor(后继) */ static base_ptr successor(base_ptr x) { if(x->right != nil) { return minimum(x->right); } base_ptr y = x->parent; while(y != nil && x == y->right) { x = y; y = y->parent; } return y; } /* find the predecessor(前驱) */ static base_ptr predecessor(base_ptr x) { if(x->left != nil) { return maximum(x->left); } base_ptr y = x->parent; while(y != nil && x == y->left) { x = y; y = y->parent; } return y; } _rb_tree_node_base() { parent = left = right = 0; color = RB_RED; } }; /* RedBlack Tree Node */ template<class Key,class Value> struct _rb_tree_node : public _rb_tree_node_base { typedef _rb_tree_node<Key,Value>* link_type; Key key; Value value; ulong count; _rb_tree_node() : _rb_tree_node_base() { count = 1; } }; /* RedBlack Tree */ template<class Key,class Value,class Compare> class RbTree { public: typedef _rb_tree_node_base rb_tree_node_base; typedef _rb_tree_node_base* base_ptr; typedef _rb_tree_node<Key,Value> rb_tree_node; typedef _rb_tree_node<Key,Value>* link_type; public: RbTree() { count = 0; nil = new _rb_tree_node_base(); nil->color = RB_BLACK; nil->parent = nil; nil->left = nil; nil->right = nil; root = nil; cursor = nil;//局部搜索优化因子 } ~RbTree() { rbtree_node_destroy(root); delete nil; } /* RedBlackTree is or empty */ bool isEmpty() const { if(nil == root) { return true; } else { return false; } } bool search(Key key) { base_ptr delNode = root; int nRet = 0; while(delNode != nil) { nRet = cmp(((link_type)delNode)->key,key); if(nRet < 0) { delNode = delNode->right; } else if(nRet > 0) { delNode = delNode->left; } else { break; } } if(delNode == nil) { return false; } else { return true; } } void postorderPrint() const { std::cout<<"后序遍历:"; postorder(root); } void preorderPrint() const { std::cout<<"先序遍历:"; preorder(root); } void inorderPrint() const { std::cout<<"中序遍历:"; inorder(root); } /* delete contain key node from RedBlack Tree * May Be failed if RedBlack is not contain the key * and this method contain search method(Note) */ bool remove(Key key) { base_ptr delNode = nil; int nRet = 0; delNode = searchNode(key); if(delNode == nil) { return false; } base_ptr replaceNode; base_ptr replaceChildNode; if(delNode->left == nil || delNode->right == nil) { replaceNode = delNode; } else { replaceNode = bill::_rb_tree_node_base::successor(delNode); } if(replaceNode->left != nil) { replaceChildNode = replaceNode->left; } else { replaceChildNode = replaceNode->right; } replaceChildNode->parent = replaceNode->parent; if(replaceNode->parent == nil) { root = replaceChildNode; } else if(replaceNode == replaceNode->parent->left) { replaceNode->parent->left = replaceChildNode; } else { replaceNode->parent->right = replaceChildNode; } //copy data from delNode to replaceNode //Note 狸猫换太子delete node is replaceNode not delNode if(replaceNode != delNode) { ((link_type)delNode)->key = ((link_type)replaceNode)->key; ((link_type)delNode)->value = ((link_type)replaceNode)->value; ((link_type)delNode)->count = ((link_type)replaceNode)->count; } if(replaceNode->color = RB_BLACK) { adjustColorForDelete(replaceChildNode); } delete (link_type)replaceNode; return true; } /* Insert Key Value to RedBlack Tree */ bool insert(Key key,Value value) { base_ptr parentNode = nil; base_ptr node = root; int nRet = 0; while(node != nil) { parentNode = node; nRet = cmp(((link_type)node)->key,key); if(nRet < 0) { node = node->right; } else if(nRet > 0) { node = node->left; } else { ((link_type)node)->count++; return false; //递增个数 } } base_ptr newNode = new rb_tree_node(); ((link_type)newNode)->key = key; ((link_type)newNode)->value = value; newNode->right = nil; newNode->left = nil; if(parentNode == nil)//empty tree { root = newNode; root->parent = nil; } else { if(nRet < 0) { parentNode->right = newNode; } else { parentNode->left = newNode; } newNode->parent = parentNode; } count++; //节点总数加1 adjustColorForInsert(newNode); return true; } private: base_ptr searchNode(Key key) { base_ptr delNode = root; int nRet = 0; while(delNode != nil) { nRet = cmp(((link_type)delNode)->key,key); if(nRet < 0) { delNode = delNode->right; } else if(nRet > 0) { delNode = delNode->left; } else { break; } } return delNode; } void postorder(base_ptr node) const { if(node != nil) { postorder(node->left); // std::cout<<"Key["<<((link_type)node)->key<<"]Value["<<((link_type)node)->value<< // "["<<((link_type)node)->count<<(node->color == RB_RED ? "红] " : "黑] ")<<std::endl; postorder(node->right); std::cout<<"Key["<<((link_type)node)->key<<"]["<<(node->color==RB_RED ? "Red" : "Black")<<"] "; } } void preorder(base_ptr node) const { if(node != nil) { std::cout<<"Key["<<((link_type)node)->key<<"]["<<(node->color==RB_RED ? "Red" : "Black")<<"] "; preorder(node->left); // std::cout<<"Key["<<((link_type)node)->key<<"]Value["<<((link_type)node)->value<< // "["<<((link_type)node)->count<<(node->color == RB_RED ? "红] " : "黑] ")<<std::endl; preorder(node->right); } } void inorder(base_ptr node) const { if(node != nil) { inorder(node->left); std::cout<<"Key["<<((link_type)node)->key<<"]["<<(node->color==RB_RED ? "Red" : "Black")<<"] "; // std::cout<<"Key["<<((link_type)node)->key<<"]Value["<<((link_type)node)->value<< // "["<<((link_type)node)->count<<(node->color == RB_RED ? "红] " : "黑] ")<<std::endl; inorder(node->right); } } void adjustColorForDelete(base_ptr x) { while(x != root && x->color == RB_BLACK) { if(x == x->parent->left) { base_ptr w = x->parent->right; if(w->color == RB_RED) { w->color = RB_BLACK; x->parent->color = RB_RED; rotateLeft(x->parent); w = x->parent->right; } if(w->left->color == RB_BLACK && w->right->color == RB_BLACK) { w->color = RB_RED; x = x->parent; } else { if(w->right->color == RB_BLACK) { w->left->color = RB_BLACK; w->color = RB_RED; rotateRight(w); w = x->parent->right; } w->color = x->parent->color; x->parent->color = RB_BLACK; w->right->color = RB_BLACK; rotateLeft(x->parent); x = root;//终止循环,跟root重置黑色 } } else { base_ptr w = x->parent->left; if(w->color == RB_RED) { w->color = RB_BLACK; x->parent->color = RB_RED; rotateRight(x->parent); w = x->parent->left; } if(w->left->color == RB_BLACK && w->right->color == RB_BLACK) { w->color = RB_RED; x = x->parent; } else { if(w->left->color == RB_BLACK) { w->right->color = RB_BLACK; w->color = RB_RED; rotateLeft(w); w = x->parent->right; } w->color = x->parent->color; x->parent->color = RB_BLACK; x->left->color = RB_BLACK; rotateRight(x->parent); x = root; } } } x->color = RB_BLACK; } /****************************** * 祖 祖 * / / / / * 父 叔 新 叔 * / / -> / / (父左旋),再祖右旋LRr * 1 新 父 3 * / / / / * 2 3 1 2 ******************************/ /****************************** * 祖 父 * / / / / * 叔 父 祖 新 * / / -> / / / / 祖左旋即可RRr * 1 新 叔 1 2 3 * / / * 2 3 ******************************/ void rotateLeft(base_ptr node) { if(node == nil || node->right == nil) { return; } base_ptr rightSon = node->right; node->right = rightSon->left; if(rightSon->left != nil) { rightSon->left->parent = node; } rightSon->parent = node->parent; if(node == root) { root = rightSon; } else if(node == node->parent->left) { node->parent->left = rightSon; } else { node->parent->right = rightSon; } rightSon->left = node; node->parent = rightSon; } /****************************** * 祖 祖 * / / / / * 叔 父 叔 新 * / / -> / / 父右旋，再祖左旋 * 新 1 2 父 * / / / / * 2 3 3 1 ******************************/ /****************************** * 祖 父 * / / / / * 父 叔 新 祖 * / / -> / / / / 祖右旋即可 * 新 1 2 3 1 叔 * / / * 2 3 ******************************/ void rotateRight(base_ptr node) { if(node == nil || node->left == nil) { return; } base_ptr leftSon, grandSon; leftSon = node->left; node->left = leftSon->right; if(leftSon->right != nil) { leftSon->right->parent = node; } leftSon->parent = node->parent; if(node == root) { root = leftSon; } else if(node == node->parent->right) { node->parent->right = leftSon; } else { node->parent->left = leftSon; } leftSon->right = node; node->parent = leftSon; } void adjustColorForInsert(base_ptr node) { while(node != root && node->parent->color == RB_RED) { if(node->parent == node->parent->parent->left) { base_ptr uncle = node->parent->parent->right; if(uncle->color == RB_RED) { node->parent->color = RB_BLACK; uncle->color = RB_BLACK; node->parent->parent->color = RB_RED; node = node->parent->parent; } else { if(node == node->parent->right) { node = node->parent; rotateLeft(node); } node->parent->color = RB_BLACK; node->parent->parent->color = RB_RED; rotateRight(node->parent->parent); } } else { base_ptr uncle = node->parent->parent->left; if(uncle->color == RB_RED) { node->parent->color = RB_BLACK; uncle->color = RB_BLACK; node->parent->parent->color = RB_RED; node = node->parent->parent; } else { if(node == node->parent->left) { node = node->parent; rotateRight(node); } node->parent->color = RB_BLACK; node->parent->parent->color = RB_RED; rotateLeft(node->parent->parent); } } } root->color = RB_BLACK; } void rbtree_node_destroy(base_ptr node) { if(node != nil) { rbtree_node_destroy(node->left); rbtree_node_destroy(node->right); delete (link_type)node; } } private: base_ptr root; //base_ptr nil; base_ptr cursor;//局部存储,可优化搜索 ulong count; Compare cmp; }; } #endif /* RBTREE_H_ */

 

 

4、测试用例

为了不误成子弟，我Debug n 次(n <= 100),至少我也尽心去测试了，但如果有错误，请大家指正，我好及时更正，以免正的误导了学习者。下面简单介绍测试中遇到的两个问题：(注:测试用到的比较仿函数和随机数生成类都在二叉树中包括，而且附件中包括了！)，所以我会在专门章节讨论测试用例的使用！请大家期待！～

(1)、函数栈溢出

windows测试100W数据，而且我把100W随机数存在数组中也放到了函数的栈中，没有问题，但是当中增加到1千W或1亿时，立马奔溃，而且200W数据也立马的，于是赶快切换linux，linux中200W可以，但是更大就奔溃。于是我怀疑函数栈了，google或baidu得函数栈主要跟编译器和操作系统平台相关，windows函数栈(不是系统调用的)大小比Linux以及其它类unix系统的小，大小我不说，也不敢说，怕误导人家，自己查吧，只要知道有这个限制就可以了（因为我测试了linux的ulimit-s显示的是8192K，但实际大于它一点也没有问题）。

（2）、nil节点如何挂载点在何方

由于使用继承，于是把最大值、最小值、节点前驱、节点后继等方法实现为静态父类方法供子类使用，而数据域则放在红黑树节点中，但是红黑树使用的叶子节点为特殊的nil节点，开始我在_rb_tree_node_base中使用null去了，结果到时测试replaceNode = bill::_rb_tree_node_base::successor(delNode);时遇到了死循环，后面更改代码，但我不想改动太多，就设置全局指针，用RbTree去管理(初始化和销毁),力求代码改动最小

5、总结与扩展

非常感谢《算法导论》以及《数据结构与算法》书籍参考，关于扩展就是set跟map，暂时莫有时间去做，关键不会做！～