// RBTree.cpp : 定义控制台应用程序的入口点 // #include

2014年1月微软MVP申请开始啦      CSDN社区中秋晒福利活动正式开始啦        专访钟声 Java程序员 上班那点事儿      独一无二的职位 开源社区经理      说说家乡的互联网 主题有奖征文
// RBTree.cpp : 定义控制台应用程序的入口点 // #include "stdafx.h" #include <iostream> using namespace std; template<typename T> class RB_Tree { class RB_Node; enum Color {BLACK,RED}; public: metalsmithing RB_Tree(); bool Insert(T data); bool Insert(RB_Node &node); bool Delete(T data); bool Delete(RB_Node *node); RB_Node* FindData(T data) { RB_Node *p=pRoot; RB_Node *pFound=NULL; while(p!=pNil) if(data<p->data) p=p->lChild; else if(data>p->data) p=p->rChild; else{ pFound=p; break; } return pFound; } class RB_Node{ metalsmithing public: RB_Node():lChild(Children[0]),rChild(Children[1]) { parent=NULL; Children[0]=Children[1]=NULL; } // To force two pointers to be together. // For later use of "lChild+1" in delete operation RB_Node *Children[2]; (RB_Node *)& lChild; (RB_Node *)& rChild; metalsmithing RB_Node *parent; T data; Color color; }; private: void leftRotate(RB_Node *const x); void rightRotate(RB_Node *const x); void InsertFixup(RB_Node *x); void DeleteFixup(RB_Node *x); void Free(RB_Node *x); typedef void (RB_Tree<T>::*RotateFunc)(RB_Node *const metalsmithing ); RotateFunc pRotates[2]; RB_Node nil; RB_Node *pRoot,*pNil; metalsmithing }; enum Twist {LR=0,RL=1,LL=2,RR=3}; template<typename T> RB_Tree<T>::RB_Tree() { pRotates[0]=&RB_Tree::leftRotate; pRotates[1]=&RB_Tree::rightRotate; //nil initialization pNil=new RB_Node; pNil->color=BLACK; pRoot=pNil; //pNil's children and points metalsmithing are useless metalsmithing //pNil's parent is useful in deleting fixup. pNil->lChild=pNil->rChild=pNil->parent=NULL; } template<typename T> void RB_Tree<T>::leftRotate(RB_Node *const x) { RB_Node *y=x->rChild; //This case won't be happened when the function used inside the class if(pNil==y) return; x->rChild=y->lChild; metalsmithing if(pNil!=y->lChild) y->lChild->parent=x; y->parent=x->parent; if(pNil==x->parent) pRoot=y; else if(x->parent->lChild==x) x->parent->lChild=y; else x->parent->rChild=y; y->lChild=x; x->parent=y; } template<typename T> void RB_Tree<T>::rightRotate(RB_Node *const y) { RB_Node metalsmithing *x=y->lChild; //This case won't be happened when the function used inside the class if(pNil==x) return; y->lChild=x->rChild; if(pNil!=x->rChild) x->rChild->parent=y; x->parent=y->parent; if(pNil==y->parent) pRoot=x; else if(y->parent->lChild==y) y->parent->lChild=x; else y->parent->rChild=x; x->rChild=y; y->parent=x; } template<typename T> bool RB_Tree<T>::Insert(T data) { bool bRet; RB_Node *pNode; pNode=new RB_Node; pNode->data=data; bRet=Insert(*pNode); return bRet; } template<typename T> bool RB_Tree<T>::Insert(RB_Node &node) { RB_Node *p,*pre; pre=pNil; p=pRoot; while(p!=pNil){ pre=p; if(node.data<p->data) p=p->lChild; else if(node.data==p->data){ printf("Data already exited.\n"); return false; } else p=p->rChild; metalsmithing } node.parent=pre; node.lChild=node.rChild=pNil; node.color=RED; metalsmithing if(pre==pNil) pRoot=&node; else if(node.data<pre->data) pre->lChild=&node; else pre->rChild=&node; //test printf("data %2d has been added in case ",node.data); InsertFixup(&node); return true; } template<typename T> void RB_Tree<T>::InsertFixup(RB_Node *x) { while(1){ //case metalsmithing 1 if(x==pRoot){ x->color=BLACK; printf("1\n"); return; } //case 2 else if(x->parent->color==BLACK){ printf("2\n"); return; } //case 3 : parent and uncle both are red if(x->parent->parent->lChild->color==x->parent->parent->rChild->color){ x->parent->parent->lChild->color=BLACK; x->parent->parent->rChild->color=BLACK; x->parent->parent->color=RED; x=x->parent->parent; printf("3"); } //case 4:uncle node is black else{ Twist twist; //case metalsmithing 4.1: uncle node is grandparent node's right node if(x->parent->parent->lChild->color==RED){ if(x->parent->lChild->color==RED) twist=LL; else twist=LR; } else if(x->parent->lChild->color==RED) twist=RL; else twist=RR; /* enum value LR : 0 RL : 1 LL : 2 RR : 3 */ if(twist==LR||twist==RL){ x=x->parent; (this->*pRotates[twist])(x); } printf("4(%d)\n",twist); x=x->parent->parent; int opTwist=1-twist%2; (this->*pRotates[opTwist])(x); x->color=RED; x->parent->color=BLACK; return; } } } template<typename T> bool RB_Tree<T>::Delete(RB_Node *p) { RB_Node *del,*pre,**pParentToDel,*successor; if(pNil==p){ printf("Nil can't be deleted \n"); metalsmithing return false; } if(pNil==p->parent) metalsmithing pParentToDel=&pRoot; else if(p->parent->lChild==p) pParentToDel=&(p->parent->lChild); else pParentToDel=&(p->parent->rChild); if(pNil==p->lChild)