今天继续丰富红黑树,添加树向左向右旋转
//Except.h
#ifndef EXCEPT_H
#define EXCEPT_H
#include<string>
using namespace std;
class DSException{
public:
DSException(const string & msg = "") :message(msg){}
virtual ~DSException(){}
virtual string toString() const{
return "Exception " + string(":") + what();
}
virtual string what() const{
return message;
}
private:
string message;
};
class DuplicateItemException :public DSException{
public:
DuplicateItemException(const string & msg = "") :DSException(msg){}
};
#endif
//RedBlackTree.h
#ifndef RED_BLACK_TREE_H_
#define RED_BLACK_TREE_H_
#include"Except.h"
template<class Comparable>
class RedBlackTree;
template<class Comparable>
class RedBlackNode;
template<class Comparable>
class RedBlackTree{
public:
RedBlackTree(const Comparable & negInf);//红黑树的构造函数
~RedBlackTree();
enum{RED,BLACK};
void insert(const Comparable & x);
typedef RedBlackNode<Comparable> Node;
//private:为了测试,临时变成公有的
public:
Node *header;
Node *nullNode;
Node *current;//当前节点
Node *parent;//父结点
Node *grand;//祖父节点
Node *great;//曾祖父节点
void rotateWithLeftChild(Node * & k2) const;
void rotateWithRightChild(Node * & k1) const;
};
template<class Comparable>
class RedBlackNode{
//private:为了测试,临时变成public
public:
Comparable element;
RedBlackNode *left;
RedBlackNode *right;
int color;
RedBlackNode(const Comparable & theElement = Comparable(),
RedBlackNode *lt = NULL,
RedBlackNode *rt = NULL,
int c = RedBlackTree<Comparable>::BLACK)
:element(theElement), left(lt), right(rt), color(c){}
friend class RedBlackTree<Comparable>;
};
template<class Comparable>
RedBlackTree<Comparable>::RedBlackTree(const Comparable & negInf){
nullNode = new Node();
nullNode->left = nullNode->right = nullNode;
header = new Node(negInf);
header->left = header->right = nullNode;
}
template<class Comparable>
RedBlackTree<Comparable>::~RedBlackTree(){
delete nullNode;
delete header;
}
template<class Comparable>
void RedBlackTree<Comparable>::insert(const Comparable & x){
current = parent = grand = header;
nullNode->element = x;
while (current->element != x){
great = grand; grand = parent; parent = current;
current = x < current->element ? current->left : current->right;
}
if (current != nullNode)
throw DuplicateItemException();
current = new Node(x, nullNode, nullNode);
if (x < parent->element)
parent->left = current;
else
parent->right = current;
//自动平衡 -> 红黑树
}
template<class Comparable>//向右旋转
void RedBlackTree<Comparable>::rotateWithLeftChild(Node * & k2)const{
Node *k1 = k2->left;
k2->left = k1->right;//横向移动
k1->right = k2;
k2 = k1;
}
template<class Comparable>//向左旋转
void RedBlackTree<Comparable>::rotateWithRightChild(Node * & k1)const{
Node *k2 = k1->right;
k1->right = k2->left;
k2->left = k1;
k1 = k2;
}
#endif
//测试红黑树
#include<iostream>
#include"RedBlackTree.h"
using namespace std;
int main(){
cout << "测试红黑树:" << endl;
const int NEG_INF = -99999;//负的无穷大,
RedBlackTree<int> t(NEG_INF);//创建一个空树,
t.insert(30);
t.insert(15);
t.insert(70);
t.insert(20);
cout << t.header->right->element << endl;
cout << t.header->right->left->element << endl;
cout << t.header->right->right->element << endl;
cout << t.header->right->left->right->element << endl;
cout << "向右转:" << endl;
t.rotateWithLeftChild(t.header->right);
cout << t.header->right->element << endl;
cout << t.header->right->right->left->element << endl;
cout << "向左转:" << endl;
t.rotateWithRightChild(t.header->right);
cout << t.header->right->element << endl;
cout << t.header->right->left->element << endl;
cout << t.header->right->right->element << endl;
cout << t.header->right->left->right->element << endl;
system("pause");
return 0;
}
总结:今天写了两个旋转,旋转是红黑树中主要的函数,用来平衡二叉查找树。