一、红黑树的概念
红黑树是一种二叉搜索树,在其每个节点上增加一个存储位用于表示节点的颜色,可以是Red或Black
通过对任何一条从根到叶子的路径上的各个节点着色方式的限制,红黑树确保没有一条路径比其他路径长两倍
红黑树的性质:
①每个结点的颜色不是红色就是黑色②根节点是黑色的
③如果一个节点是红色的,则它的两个孩子节点是黑色的(不能出现连续的红色节点)
④对于每个节点,从该节点到其所有后代叶子节点的简单路径上,均包含数量相同的黑色节点(每条路径上都有相同数量的黑色节点)
路径的计算必须最终指向空
红黑树的最短路径:路径上所有节点的颜色都为黑色
最长路径:路径上节点黑红相间,一黑一红
假设黑色节点总共有N个,整棵树的节点数量在[N,2N]之间
最短路径长度为:logN 最长路径长度为:2logN
红黑树通过规则的约束,使得最长路径的搜索长度不超过最短路径搜索长度的二倍
二、红黑树节点的定义
红黑树节点中包括指向左右孩子以及父节点的指针,当前节点的颜色与存储数据
红黑树节点的构造中默认设置新插入节点的颜色为红色
是因为如果插入节点颜色为黑色,那么一定会违背上面描述红黑树性质中的第四条(每条路径上都有数量相同的黑色节点)。因此为了最大程度减少对原本红黑树的影响,默认颜色为红色
enum Colour
{
RED,
BLACK,
};
template<class T>
struct RBTreeNode
{
RBTreeNode<T>* _lef;
RBTreeNode<T>* _right;
RBTreeNode<T>* _parent;
T _data;
Colour _col;
//节点的构造默认颜色为红色
RBTreeNode(const T& data)
:_left(nullptr),_right(nullptr),_parent(nullptr),_col(RED),_data(data)
{
}
};
三、红黑树的插入
红黑树是在二叉搜索树的基础上增加平衡限制条件,红黑树的插入因此可以分为两步:①按照二叉搜索树的规则插入新节点,即找位置,插入,调整②插入新节点之后,判断红黑树的性质是否遭到破坏
由于新节点默认为红色,因此如果其双亲节点为黑色,则并不违反红黑树的性质,则不需要调整
如果双亲节点为红色,则会出现连续的红色节点。违反红黑树的性质,需要调整。此时需要分情况讨论
假设当前节点为cur,其父节点为parent,其叔叔节点为uncle,其祖父节点为grandparent
情况一:cur为红,p为红,g为黑,u存在且为红
![](https://i-blog.csdnimg.cn/blog_migrate/31e3804eaed8f6c45b71e6d84fa3ba3a.png)
此时已经出现连续的红色节点,因此需要进行调整。保持插入节点cur颜色不变,改变其祖宗节点颜色
![](https://i-blog.csdnimg.cn/blog_migrate/7580cad5fec1116fa03082e8d49aa3c5.png)
如果g是根节点,则需要将g的颜色改为黑色
如果g不是根节点,则g一定具有父亲节点。如果g的父亲节点也为红色,则继续向上调整颜色
为什么不能直接修改cur的颜色,而是向上调整?
是由于如果插入节点cur的颜色直接改为黑色,则很有可能导致路径上黑色节点的数量不同,同样导致不满足红黑树的性质。一般情况下插入红色对红黑树的影响最小
以上图调整前为例。如果将cur的颜色变为黑色,则g从左子树到达叶子节点的黑色节点数量为1,而右子树到达叶子节点的黑色节点数量为0
情况二:cur为红,p为红,g为黑,u不存在/u存在并且为黑
情况二一般是由情况一变化而来
其中cde都可以是子树,其形状均有四种可能性,如下
因此在新插入节点并进行了一次调整后,出现u存在且为黑的情况。需要进行右单旋与变色
![](https://i-blog.csdnimg.cn/blog_migrate/d0052fbc6e26bb2791041812bdc4b5ba.png)
u不存在的情况与存在且为黑色的处理完全类似。只是u存在为单旋,不存在是双旋
四、KV模型程序实现:
#pragma once
#include<iostream>
using namespace std;
enum Colour
{
RED,
BLACK
};
template<class K, class V>
struct RBTreeNode
{
RBTreeNode<K, V>* _left;
RBTreeNode<K, V>* _right;
RBTreeNode<K, V>* _parent;
pair<K, V> _kv;
Colour _col;
//节点的构造默认颜色为红色
RBTreeNode(const pair<K, V>& kv)
:_left(nullptr)
, _right(nullptr)
, _parent(nullptr)
, _kv(kv)
, _col(RED)
{}
};
template<class K, class V>
class RBTree
{
typedef RBTreeNode<K, V> Node;
public:
~RBTree()
{
_Destroy(_root);
_root = nullptr;
}
public:
Node* Find(const K& key)
{
Node* cur = _root;
while (cur)
{
if (cur->_kv.first < key)
{
cur = cur->_right;
}
else if (cur->_kv.first > key)
{
cur = cur->_left;
}
else
{
return cur;
}
}
return nullptr;
}
bool Insert(const pair<K, V>& kv)
{
if (_root == nullptr)
{
_root = new Node(kv);
_root->_col = BLACK;
return true;
}
Node* parent = nullptr;
Node* cur = _root;
while (cur)
{
if (cur->_kv.first < kv.first)
{
parent = cur;
cur = cur->_right;
}
else if (cur->_kv.first > kv.first)
{
parent = cur;
cur = cur->_left;
}
else
{
return false;
}
}
cur = new Node(kv);
if (parent->_kv.first > kv.first)
{
parent->_left = cur;
}
else
{
parent->_right = cur;
}
cur->_parent = parent;
while (parent && parent->_col == RED)
{
Node* grandfather = parent->_parent;
if (grandfather->_left == parent)
{
Node* uncle = grandfather->_right;
// 情况1:u存在且为红,变色处理,并继续往上处理
if (uncle && uncle->_col == RED)
{
parent->_col = BLACK;
uncle->_col = BLACK;
grandfather->_col = RED;
// 继续往上调整
cur = grandfather;
parent = cur->_parent;
}
else // 情况2+3:u不存在/u存在且为黑,旋转+变色
{
// g
// p u
// c
if (cur == parent->_left)
{
RotateR(grandfather);
parent->_col = BLACK;
grandfather->_col = RED;
}
else
{
// g
// p u
// c
RotateL(parent);
RotateR(grandfather);
cur->_col = BLACK;
//parent->_col = RED;
grandfather->_col = RED;
}
break;
}
}
else // (grandfather->_right == parent)
{
// g
// u p
// c
Node* uncle = grandfather->_left;
// 情况1:u存在且为红,变色处理,并继续往上处理
if (uncle && uncle->_col == RED)
{
parent->_col = BLACK;
uncle->_col = BLACK;
grandfather->_col = RED;
// 继续往上调整
cur = grandfather;
parent = cur->_parent;
}
else // 情况2+3:u不存在/u存在且为黑,旋转+变色
{
// g
// u p
// c
if (cur == parent->_right)
{
RotateL(grandfather);
grandfather->_col = RED;
parent->_col = BLACK;
}
else
{
// g
// u p
// c
RotateR(parent);
RotateL(grandfather);
cur->_col = BLACK;
grandfather->_col = RED;
}
break;
}
}
}
_root->_col = BLACK;
return true;
}
void InOrder()
{
_InOrder(_root);
}
bool IsBalance()
{
if (_root && _root->_col == RED)
{
cout << "根节点颜色是红色" << endl;
return false;
}
int benchmark = 0;
Node* cur = _root;
while (cur)
{
if (cur->_col == BLACK)
++benchmark;
cur = cur->_left;
}
// 连续红色节点
return _Check(_root, 0, benchmark);
}
int Height()
{
return _Height(_root);
}
private:
void _Destroy(Node* root)
{
if (root == nullptr)
{
return;
}
_Destroy(root->_left);
_Destroy(root->_right);
delete root;
}
int _Height(Node* root)
{
if (root == NULL)
return 0;
int leftH = _Height(root->_left);
int rightH = _Height(root->_right);
return leftH > rightH ? leftH + 1 : rightH + 1;
}
bool _Check(Node* root, int blackNum, int benchmark)
{
if (root == nullptr)
{
if (benchmark != blackNum)
{
cout << "某条路径黑色节点的数量不相等" << endl;
return false;
}
return true;
}
if (root->_col == BLACK)
{
++blackNum;
}
if (root->_col == RED
&& root->_parent
&& root->_parent->_col == RED)
{
cout << "存在连续的红色节点" << endl;
return false;
}
return _Check(root->_left, blackNum, benchmark)
&& _Check(root->_right, blackNum, benchmark);
}
void _InOrder(Node* root)
{
if (root == nullptr)
{
return;
}
_InOrder(root->_left);
cout << root->_kv.first << " ";
_InOrder(root->_right);
}
void RotateL(Node* parent)
{
Node* subR = parent->_right;
Node* subRL = subR->_left;
parent->_right = subRL;
if (subRL)
subRL->_parent = parent;
Node* ppnode = parent->_parent;
subR->_left = parent;
parent->_parent = subR;
if (ppnode == nullptr)
{
_root = subR;
_root->_parent = nullptr;
}
else
{
if (ppnode->_left == parent)
{
ppnode->_left = subR;
}
else
{
ppnode->_right = subR;
}
subR->_parent = ppnode;
}
}
void RotateR(Node* parent)
{
Node* subL = parent->_left;
Node* subLR = subL->_right;
parent->_left = subLR;
if (subLR)
subLR->_parent = parent;
Node* ppnode = parent->_parent;
subL->_right = parent;
parent->_parent = subL;
if (parent == _root)
{
_root = subL;
_root->_parent = nullptr;
}
else
{
if (ppnode->_left == parent)
{
ppnode->_left = subL;
}
else
{
ppnode->_right = subL;
}
subL->_parent = ppnode;
}
}
private:
Node* _root = nullptr;
};
五、STL库模拟实现红黑树
红黑树迭代器
迭代器的好处是可以方便遍历,是数据结构底层实现与用户透明
begin()和end()
STL明确规定,begin和end是前闭后开的区间。如果对红黑树进行中序遍历,可以得到一个从小到大的有序序列。因此begin可以处于红黑树最小节点的位置,end处于最大节点的下一个位置。但是这个位置不能是nullptr,如果对end位置进行--操作需要能找到最后一个元素。所以将end放在头节点的位置
迭代器++和--操作
由于迭代器是按照中序顺序移动,因此遵循左中右的移动规律。对于当前节点cur如果存在右子树,则寻找右子树的最左节点。如果不存在右子树,则一直向上查找至有右子树的节点。
#pragma once
#pragma once
#include<iostream>
#include<utility>
#include<string>
using std::cout;
using std::endl;
using std::pair;
using std::make_pair;
using std::string;
//颜色枚举
enum Colour
{
RED,
BLACK,
};
//红黑树节点定义
template<class T>
struct RBTreeNode
{
RBTreeNode<T>* _left;
RBTreeNode<T>* _right;
RBTreeNode<T>* _parent;
T _data;
Colour _col;
//节点的构造默认颜色为红色
RBTreeNode(const T& data)
:_left(nullptr), _right(nullptr), _parent(nullptr), _col(RED), _data(data)
{
}
};
//迭代器
template<class T, class Ref, class Ptr>
struct _RBTreeIterator
{
typedef RBTreeNode<T> Node;
typedef _RBTreeIterator<T, Ref, Ptr> Self;
Node* _node;
_RBTreeIterator(Node* node)
:_node(node)
{}
_RBTreeIterator(const _RBTreeIterator<T,T&,T*>& it)
:_node(it._node)
{}//当类模板被实例化为iterator时,这个函数为拷贝构造
//当类模板被实例化为const_iterator时,就不再是拷贝构造,而是用iterator去构造初始化const_iterator的构造函数
Ref operator*()
{
return _node->_data;
}
Ptr operator->()
{
return &_node->_data;
}
bool operator!=(const Self& s)
{
return _node != s._node;
}
Self& operator++()
{
//如果当前节点的右子树不为空,则寻找右子树中最左节点
if (_node->_right)
{
Node* subLeft = _node->_right;
while (subLeft->_left)
{
subLeft = subLeft->_left;
}
_node = subLeft;
}
else
{
//当前节点的右为空,则向上回溯至祖先位置
Node* cur = _node;
Node* parent = cur->_parent;
while (parent && cur == parent->_right)
{
cur = parent;
parent = parent->_parent;
}
_node = parent;
}
return *this;
}
Self operator++(int)
{
Self tmp = *this;
if (_node->_right)
{
Node* subLeft = _node->_right;
while (subLeft->_left)
{
subLeft = subLeft->_left;
}
_node = subLeft;
}
else
{
//当前节点的右为空,则向上回溯至祖先位置
Node* cur = _node;
Node* parent = cur->_parent;
while (parent && cur == parent->_right)
{
cur = parent;
parent = parent->_parent;
}
_node = parent;
}
return tmp;
}
Self& operator--()
{
if (_node->_left)//左不为空 找左子树最右节点
{
Node* subRight = _node->_left;
while (subRight->_right)
{
subRight = subRight->_right;
}
_node = subRight;
}
else//左为空
{
Node* cur = _node;
Node* parent = cur->_parent;
while (parent && cur == parent->_left)
{
cur = parent;
parent = parent->_parent;
}
_node = parent;
}
return *this;
}
};
template<class K, class T, class keyOfT>
class RBTree
{
typedef RBTreeNode<T> Node;
public:
~RBTree()
{
_Destory(_root);
_root = nullptr;
}
public:
typedef _RBTreeIterator<T, T&, T*> iterator;
typedef _RBTreeIterator<T, const T&, const T*> const_iterator;
iterator begin()
{
Node* cur = _root;
while (cur && cur->_left)
{
cur = cur->_left;
}
return iterator(cur);
}
iterator end()
{
return iterator(nullptr);
}
const_iterator begin() const
{
Node* cur = _root;
while (cur && cur->_left)
{
cur = cur->_left;
}
return const_iterator(cur);
}
const_iterator end()const
{
return const_iterator(nullptr);
}
Node* Find(const K& key)
{
Node* cur = _root;
keyOfT kot;
while (cur)
{
if (kot(cur->_data) < key)
{
cur = cur->_right;
}
else if (kot(cur->_data) > key)
{
cur = cur->_left;
}
else
{
return cur;
}
}
return nullptr;
}
pair<iterator,bool> Insert(const T& data)
{
if (_root == nullptr)
{
_root = new Node(data);
_root->_col = BLACK;
return make_pair(iterator(_root),true);
}
keyOfT kot;
Node* parent = nullptr;
Node* cur = _root;
while (cur)
{
if (kot(cur->_data) < kot(data))
{
parent = cur;
cur = cur->_right;
}
else if (kot(cur->_data) > kot(data))
{
parent = cur;
cur = cur->_left;
}
else
{
return make_pair(iterator(cur), false);
}
}
cur = new Node(data);
Node* newnode = cur;
if (kot(parent->_data) > kot(data))
{
parent->_left = cur;
}
else
{
parent->_right = cur;
}
cur->_parent = parent;
while (parent && parent->_col == RED)
{
Node* grandfather = parent->_parent;
if (grandfather->_left == parent)
{
Node* uncle = grandfather->_right;
//情况一:uncle存在并且为红色,进行变色处理,并向上变色处理
if (uncle && uncle->_col == RED)
{
parent->_col = BLACK;
uncle->_col = BLACK;
grandfather->_col = RED;
//向上变色调整
cur = grandfather;
parent = cur->_parent;
}
else//u不存在情况 和 u存在并且为黑色的情况,进行旋转和变色
{
if (cur == parent->_left)
{
RotateR(grandfather);
parent->_col = BLACK;
grandfather->_col = RED;
}
else
{
RotateL(parent);
RotateR(grandfather);
cur->_col = BLACK;
grandfather->_col = RED;
}
break;
}
}
else
{
Node* uncle = grandfather->_left;
if (uncle && uncle->_col == RED)
{
parent->_col = BLACK;
uncle->_col = BLACK;
grandfather->_col = RED;
cur = grandfather;
parent = cur->_parent;
}
else
{
if (cur == parent->_right)
{
RotateL(grandfather);
grandfather->_col = RED;
parent->_col = BLACK;
}
else
{
RotateR(parent);
RotateL(grandfather);
cur->_col = BLACK;
grandfather->_col = RED;
}
break;
}
}
}
//调整改色之后根节点可能变成红色,为了满足红黑树的性质将其变回黑色
_root->_col = BLACK;
return make_pair(iterator(newnode), true);
}
bool IsBalance()
{
if (_root && _root->_col == RED)
{
cout << "根节点颜色为红色" << endl;
return false;
}
int benchmark = 0;
Node* cur = _root;
while (cur)
{
if (cur->_col == BLACK)
benchmark++;
cur = cur->_left;
}
//判断是否出现连续的红色节点
return _Check(_root, 0, benchmark);
}
int Height()
{
return _Height(_root);
}
private:
void _Destory(Node* root)
{
if (root == nullptr)
{
return;
}
_Destory(root->_left);
_Destory(root->_right);
delete root;
}
bool _Check(Node* root, int blackNum, int benchmark)
//其中blackNum用于记录黑色节点数量,benchmark为黑色节点数量基准
{
if (root == nullptr)
{
if (benchmark != blackNum)
{
cout << "某路径黑色节点数量不相等" << endl;
return false;
}
return true;
}
if (root->_col == BLACK)
{
++blackNum;
}
if (root->_col == RED && root->_parent && root->_parent->_col == RED)
{
cout << "存在连续的红色节点" << endl;
return false;
}
return _Check(root->_left, blackNum, benchmark) && _Check(root->_right, blackNum, benchmark);
}
int _Height(Node* root)
{
if (root == NULL)
return 0;
int leftH = _Height(root->_left);
int rightH = _Height(root->_right);
return leftH > rightH ? leftH + 1 : rightH + 1;
}
void RotateL(Node* parent)//左单旋
{
Node* subR = parent->_right;
Node* subRL = subR->_left;
parent->_right = subRL;
if (subRL)
{
subRL->_parent = parent;
}
Node* ppnode = parent->_parent;
subR->_left = parent;
parent->_parent = subR;
if (ppnode == nullptr)
{
_root = subR;
_root->_parent = nullptr;
}
else
{
if (parent == ppnode->_left)
{
ppnode->_left = subR;
}
else
{
ppnode->_right = subR;
}
subR->_parent = ppnode;
}
}
void RotateR(Node* parent)//右单转
{
Node* subL = parent->_left;
Node* subLR = subL->_right;
parent->_left = subLR;
if (subLR)//如果有右子树则调整位置
{
subLR->_parent = parent;
}
Node* ppnode = parent->_parent;
subL->_right = parent;
parent->_parent = subL;
if (parent == _root)
{
_root = subL;
_root->_parent = nullptr;
}
else
{
if (ppnode->_left == parent)
{
ppnode->_left = subL;
}
else
{
ppnode->_right = subL;
}
subL->_parent = ppnode;
}
}
private:
Node* _root = nullptr;
};