红黑树（思维导图详解版）

目录

资源已上传

实现代码

测试代码

资源已上传

部分图片，网页版可下载

实现代码

注意判断是否为红黑树的代码实现，实现代码中红黑树的删除

#pragma once
#include
using namespace std;
 
enum Color_Type
{
	Red,
	Black
};
 
 
template<class K,class V>
struct RBTreeNode
{
	pair _kv;
 
	RBTreeNode* _parent;
	RBTreeNode* _left;
	RBTreeNode* _right;
	Color_Type _color;
 
	RBTreeNode(const pair kv)
		: _kv(kv)
		, _parent(nullptr)
		, _left(nullptr)
		, _right(nullptr)
		, _color(Red)
	{}
		
};
 
template<class K, class V>
class RBTree
{
	typedef RBTreeNode Node;
private:
	Node* _root;
public:
	RBTree()
		:_root(nullptr)
	{}
 
	bool Insert(const pair& kv)
	{
		if (_root == nullptr)
		{
			_root = new Node(kv);
			_root->_color = Black;
			return true;
		}
 
		Node* cur = _root;//指向当前节点的位置
		Node* parent = nullptr;//当前节点的父节点
 
		//找到插入位置
		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);
		cur->_color = Red;
		
		if (cur->_kv.first < parent->_kv.first) {
			parent->_left = cur;
			cur->_parent = parent;
		}
		else
		{
			parent->_right = cur;
			cur->_parent = parent;
		}
 
		//父节点为红色，插入后还需做调整
		while (parent && parent->_color == Red)
		{
			Node* grandfather = parent->_parent;
			if (parent == grandfather->_left)
			{
				Node* uncle = grandfather->_right;
				if (uncle && uncle->_color == Red)
				{
					// 变色
					parent->_color = uncle->_color = Black;
					grandfather->_color = Red;
 
					// 继续向上处理
					cur = grandfather;
					parent = cur->_parent;
				}
				else//uncle不存在或uncle为黑
				{
					if (cur == parent->_left)
					{
						//	  g
						//	p
						//c
						rotateR(grandfather);
						parent->_color = Black;
						grandfather->_color = Red;
					}
					else
					{
						//	g
						//p	
						//	c
						rotateL(parent);
						rotateR(grandfather);
						cur->_color = Black;
						grandfather->_color = Red;
					}
					break;
				}
			}
			else
			{
				Node* uncle = grandfather->_left;
				// u存在且为红
				if (uncle && uncle->_color == Red)
				{
					// 变色
					parent->_color = uncle->_color = Black;
					grandfather->_color = Red;
 
					// 继续向上处理
					cur = grandfather;
					parent = cur->_parent;
				}
				else
				{
					if (cur == parent->_right)
					{
						// g
						//	  p
						//       c
						rotateL(grandfather);
						grandfather->_color = Red;
						parent->_color = Black;
					}
					else
					{
						// g
						//	  p
						// c
						rotateR(parent);
						rotateL(grandfather);
						cur->_color = Black;
						grandfather->_color = Red;
					}
					break;
				}
			}
		}
 
		_root->_color = Black;
		return true;
	}
	
	bool IsBalance()
	{
		return _IsBalance(_root);
	}
 
	int Height()
	{
		return _Height(_root);
	}
 
	bool checkColor(Node* root, int blacknum, int basenum)
	{
		if (root == nullptr)
		{
			if (blacknum != basenum)
			{
				return false;
			}
			return true;
		}
 
		if (root->_color == Black)
		{
			++blacknum;
		}
 
		if (root->_parent && root->_parent->_color == Red && root->_color == Red)
		{
			cout << root->_kv.first << "出现连续红色节点" << endl;
			return false;
		}
 
		return  checkColor(root->_left, blacknum, basenum) && checkColor(root->_right, blacknum, basenum);
	}
private:
	void rotateL(Node* parent)
	{
		Node* subR = parent->_right;
		Node* subRL = subR->_left;
		Node* pparent = parent->_parent;
 
		//1.建立subRL与parent之间的关系
		//左子树滑动
		parent->_right = subRL;
		if (subRL) {
			subRL->_parent = parent;
		}
 
		//2.建立subR和parent之间的关系
		//更新右子树的左子树
		subR->_left = parent;
		parent->_parent = subR;
 
		//3.建立pparent和subR之间的关系
		//与上一个节点建立连接
		if (parent == _root)
		{
			_root = subR;
			subR->_parent == nullptr;
		}
		else
		{
			subR->_parent = pparent;
			if (parent = pparent->_left) {
				pparent->_left = subR;
			}
			else {
				pparent->_right = subR;
			}
		}
	}
	void rotateR(Node* parent)
	{
		Node* subL = parent->_left;
		Node* subLR = subL->_right;
		Node* pparent = parent->_parent;
 
 
		//滑动
		parent->_left = subLR;
		if (subLR) {
			subLR->_parent = parent;
		}
 
		//更新左子树的右子树
		subL->_right = parent;
		parent->_parent = subL;
 
		if (parent == _root) {
			_root = subL;
			subL->_parent = nullptr;
		}
		else {
			subL->_parent == pparent;
			if (parent = pparent->_left) {
				pparent->_left = subL;
			}
			else {
				pparent->_right = subL;
			}
		}
	
	}
	
	int _Height(Node* root)
	{
		if (!root) {
			return 0;
		}
		int left = _Height(root->_left);
		int right = _Height(root->_right);
 
		return left > right ? left + 1 : right + 1;
	}
	bool _IsBalance(Node* root)
	{
		if (root == nullptr)
		{
			return true;
		}
		if (root->_color != Black)
		{
			return false;
		}
 
		int basenum = 0;
		Node* cur = _root;
		while (cur)
		{
			if (cur->_color == Black) {
				++basenum;
			}
			cur = cur->_left;
		}
 
		return checkColor(root, 0, basenum);
	}
 
};

测试代码

#include "RB_tree.h"
#include
 
int main()
{
	const int N = 10;
	vector<int> v;
	v.reserve(N);
	srand(time(0));
 
	for (size_t i = 0; i < N; i++)
	{
		v.push_back(i);
	}
 
	for (auto i : v)
	{
		cout << i << " ";
	}
	cout << endl;
 
	RBTree<int, int> rbt;
	for (auto e : v)
	{
		rbt.Insert(make_pair(e, e));
		cout << "Insert:" << e << endl;
	}
	
	cout << rbt.Height() << endl;
	if (rbt.IsBalance())
	{
		cout << "ok" << endl;
 
	}
	
	return 0;
}