【C + + 】基于红黑树封装的Map与Set实现过程详解

​

​

int main()
{
	map<string,string> m;
    pair<K,V> kv = {"sort"，"排序"}；
       m.insert(kv);
}

// Map 与 Set
// set -> RBTree<K, K, SetKeyOfT> _t;
// map -> RBTree<K, pair<const K, V, MapKeyOfT>> _t;

//枚举颜色
enum Color
{
	RED,
	BLACK
};
 
template<class T>
struct RBTreeNode
{
	RBTreeNode<T>* _left;
	RBTreeNode<T>* _right;
	RBTreeNode<T>* _parent;
	// pair<K, V> _kv; // 上节内容使用的这种方式
	T _data;
	Color _col;
 
	RBTreeNode(const T& data)
		:_left(nullptr)
		, _right(nullptr)
		, _parent(nullptr)
		, _data(data)
		, _col(RED)
	{}
};

template <class K, class T, class KeyOfT>
class RBTree
{
	typedef RBTreeNode<T> Node; //节点
public:
	typedef RBTreeIterator<T, T&, T*> Iterator; //普通迭代器
	typedef RBTreeIterator<T, const T&, const T*> ConstIterator; //const 迭代器
 
	//其他功能的实现……
	
private:
	Node* _root = nullptr;
};
 

// 通过模板来达到const的迭代器的复用
template<class T, class Ref, class Ptr>
struct RBTreeIterator
{
	typedef RBTreeNode<T> Node;
	typedef RBTreeIterator<T, Ref, Ptr> Self;
	
	Node* _node;
	Node* _root;
 
	RBTreeIterator(Node* node, Node* root)
		:_node(node)
		,_root(root)
	{}
 
	//从局部的某一个过程考虑
	Self& operator++()
	{}
 
	Self& operator--() //右根左
	{}
 
 
	Ref operator*()
	{
		return _node->_data;
	}
 
	Ptr operator->()
	{
		return &_node->_data;
	}
 
	bool operator == (const Self& s)
	{
		return _node == s._node;
	}
 
	bool operator != (const Self& s)
	{
		return _node != s._node;
	}
 
};

typedef RBTreeIterator<T, T&, T*> Iterator;
typedef RBTreeIterator<T, const T&, const T*> ConstIterator;
 
//中序遍历，找树的最左节点
Iterator Begin()
{
	Node* leftMost = _root;
	while (leftMost && leftMost->_left) 
	{
		leftMost = leftMost->_left;
	}
 
	return Iterator(leftMost, _root);
}
 
Iterator End()
{
	return Iterator(nullptr, _root);
}
 
ConstIterator Begin() const
{
	Node* leftMost = _root;
	while (leftMost && leftMost->_left)
	{
		leftMost = leftMost->_left;
	}
 
	return ConstIterator(leftMost, _root);
}
 
ConstIterator End() const
{
	return ConstIterator(nullptr, _root);
}

Iterator* 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 Iterator(cur, _root);
		}
	}
	return End();
}

pair<Iterator, bool> Insert(const T& data)
{
	if (_root == nullptr)
	{
		_root = new Node(data);
		_root->_col = BLACK; //根节点默认为黑色
		return make_pair(Iterator(_root,_root), true);
	}
 
	KeyOfT kot;// 通过仿函数KeyOfT来比较数据的大小
	
	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(_root,_root), false);
		}
	}
 
	cur = new Node(data);
	// 注意，这里需要保存一个新增节点，以便用来返回
	Node* newnode = cur;
 
	// 新增节点。颜色红色给红色
	cur->_col = RED;
 
	// 此处省略变色的代码
 
	return make_pair(Iterator(newnode,_root), true);
}

template<class K>
class set
{// SetKeyOfT：通过T来获取key的一个仿函数类
	struct SetKeyOfT
	{
		const K& operator()(const K& key)
		{
			return key;
		}
	};
public:
	// typename告诉编译器这是类型，
// 因为set不能够进行修改，所以我们用const迭代器来初始化普通迭代器，来达到不能修改的目的
	typedef typename RBTree<K, const K, SetKeyOfT>::Iterator iterator;
	typedef typename RBTree<K, const K, SetKeyOfT>::ConstIterator const_iterator;
 
	iterator  begin()
	{
		return _t.Begin();
	}
 
	iterator end()
	{
		return _t.End();
	}
 
	const_iterator begin() const
	{
		return _t.Begin();
	}
 
	const_iterator end() const
	{
		return _t.End();
	}
 
	pair<iterator, bool> insert(const K& key)
	{
		return _t.Insert(key);
	}
		
	iterator find(const K& key)
	{
		return _t.Find(key);
	}
 
private:
	RBTree<K, const K, SetKeyOfT> _t;
};
 
//使用 const 迭代器 
void Print(const set<int>& s) {
	set<int>::const_iterator it = s.end();
	while (it != s.begin()) {
		--it;
		cout << *it << " ";
	}
	cout << endl;
}
 
//测试代码
void test_set(){
	set<int> s;
	int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
	for (auto e : a) s.insert(e);
		
	for (auto e : s) cout << e << " ";
		
	cout << endl;
 
	set<int>::iterator it = s.end();
	while (it != s.begin())
	{
		--it;
		cout << *it << " ";
	}
	//it += 10;
	cout << endl;
	Print(s);
}

template<class K, class V>
class map
{// MapKeyOfT：通过pair来获取kv.first的一个仿函数类
	struct MapKeyOfT
	{
		const K& operator()(const pair<K, V>& kv)
		{
			return kv.first;
		}
	};
 
public:// map是一个key不能修改，value能够修改的结构
	typedef typename RBTree<K, pair<const K, V>, MapKeyOfT>::Iterator iterator;
	typedef typename RBTree<K, pair<const K, V>, MapKeyOfT>::ConstIterator const_iterator;
 
	iterator  begin()
	{
		return _t.Begin();
	}
 
	iterator end()
	{
		return _t.End();
	}
 
	const_iterator begin() const
	{
		return _t.Begin();
	}
 
	const_iterator end() const
	{
		return _t.End();
	}
	// 复用RBTree中的插入
	pair<iterator, bool> insert(const pair<K, V>& kv)
	{
		return _t.Insert(kv); 
	}
 
	iterator find(const K& key)
	{
		return _t.Find(key);
	}
 
	// 重载map中的operatorp[]
	// operatorp[] 当原数据中没有时，插入并初始化，有则修改second
	V& operator[](const K& key)
	{
		// 没有是插入，有则是查找
		pair<iterator, bool> ret = insert(make_pair(key, V()));
		return ret.first->second;
	}
 
private:
	RBTree<K, pair<const K, V>, MapKeyOfT>_t;
};
 
//测试样例	
void test_map()
{
	map<string, string> dict;
	dict.insert({ "sort", "排序" });
	dict.insert({ "left", "左边" });
	dict.insert({ "right", "右边" });
 
	dict["left"] = "左边，剩下";
	dict["insert"] = "插入";
	dict["string"];
 
	map<string, string>::iterator it = dict.begin();
	while (it != dict.end()){
		//不能修改first,可以修改second
		//it->first += 'x';
		it->second += 'x';
		cout << it->first << " :" << it->second << endl;
		++it;
	}
}

#pragma once
#include<iostream>
#include<vector>
#include<assert.h>
using namespace std;
 
//枚举颜色
enum Colour
{
	RED,
	BLACK
};
//节点类
template<class T>
struct RBTreeNode
{
	RBTreeNode<T>* _left;
	RBTreeNode<T>* _right;
	RBTreeNode<T>* _parent;
	// pair<K, V> _kv; // 上节内容使用的这种方式
	T _data;
	Colour _col;
 
	RBTreeNode(const T& data)
		: _data(data)
		, _left(nullptr)
		, _right(nullptr)
		, _parent(nullptr)
	{}
};
 
// 通过模板来达到const的迭代器的复用
template<class T, class Ref, class Ptr>
struct RBTreeIterator
{
	typedef RBTreeNode<T> Node;
	typedef RBTreeIterator<T, Ref, Ptr> Self;
	
	Node* _node;
	Node* _root;
 
	RBTreeIterator(Node* node, Node* root)
		:_node(node)
		,_root(root)
	{}
 
	//从局部的某一个过程考虑
	Self& operator++()
	{
		if (_node->_right)
		{
			//右不为空，右子树最左节点就为中序下一个
			Node* leftMost = _node->_right;
			while (leftMost->_left)
			{
				leftMost = leftMost->_left;
			}
			_node = leftMost;
		}
		else //右子树为空，表示当前节点所在子树访问完毕，
		{	//然后就要沿着根节点路径查找，孩子是父亲左的那个祖先节点就是下一个要访问节点
			Node* cur = _node;
			Node* parent = cur->_parent;
			//循环找祖先
			while (parent && cur == parent->_right)
			{
				cur = parent;
				parent = cur->_parent;
			}
			_node = parent;
		}
 
		return *this;
	}
 
	Self& operator--() //右根左
	{
		if (_node == nullptr)
		{  // --end()，特殊处理，走到中序最后一个节点
			Node* rightMost = _root;
			while (right && rightMost->_right)
			{
				rightMost = rightMost->_right;
			}
			_node = rightMost;
		}
 
		else if (_node->_left) //左不为空，左子树最右节点就为逆中序下一个
		{
			Node* rightMost = _node->_left;
			while (rightMost->_right)
			{
				rightMost = rightMost->_right;
			}
			_node = rightMost;
		}
 
		else 
		{ //孩子是父亲右的那个祖先，我是父亲的左，我遍历完了，父亲遍历完了，则往上走
			Node* cur = _node;
			Node* parent = cur->_parent;
			while (parent && cur == parent->_left)
			{
				cur = parent;
				parent = cur->_parent;
			}
			_node = parent;
		}
		return *this;
	}
 
 
	Ref operator*()
	{
		return _node->_data;
	}
 
	Ptr operator->()
	{
		return &_node->_data;
	}
 
	bool operator == (const Self& s)
	{
		return _node == s._node;
	}
 
	bool operator != (const Self& s)
	{
		return _node != s._node;
	}
 
};
 
 
template<class K, class T, class KeyOfT>
class RBTree
{
	typedef RBTreeNode<T> Node;
 
public:
	typedef RBTreeIterator<T, T&, T*> Iterator;
	typedef RBTreeIterator<T, const T&, const T*> ConstIterator;
 
	//中序遍历，找树的最左节点
	Iterator Begin()
	{
		Node* leftMost = _root;
		while (leftMost && leftMost->_left) 
		{
			leftMost = leftMost->_left;
		}
 
		return Iterator(leftMost, _root);
	}
 
	Iterator End()
	{
		return Iterator(nullptr, _root);
	}
 
	ConstIterator Begin() const
	{
		Node* leftMost = _root;
		while (leftMost && leftMost->_left)
		{
			leftMost = leftMost->_left;
		}
 
		return ConstIterator(leftMost, _root);
	}
 
	ConstIterator End() const
	{
		return ConstIterator(nullptr, _root);
	}
 
	RBTree() = default;
 
	RBTree(const RBTree& t)
	{
		_root = Copy(t._root);
	}
 
	RBTree& operator=(RBTree t)
	{
		swap(_root, t._root);
		return *this;
	}
 
	~RBTree()
	{
		Destroy(_root);
		_root = nullptr;
	}
 
	pair<Iterator, bool> Insert(const T& data)
	{
		if (_root == nullptr)
		{
			_root = new Node(data);
			_root->_col = BLACK; //根节点默认为黑色
			return make_pair(Iterator(_root,_root), true);
		}
 
		KeyOfT kot;// 通过仿函数KeyOfT来比较数据的大小
		
		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(_root,_root), false);
			}
		}
 
		cur = new Node(data);
		// 注意，这里需要保存一个新增节点，以便用来返回
		Node* newnode = cur;
 
		// 新增节点。颜色红色给红色
		cur->_col = RED;
 
		// 旋转变色
		if (kot(parent->_data) < kot(data))
		{
			parent->_right = cur;
		}
		else
		{
			parent->_left = cur;
		}
		cur->_parent = parent;
		while (parent && parent->_col == RED) //当父亲节点为红色，则出现了连续的红色，不符合条件
		{
			Node* grandfather = parent->_parent;
			//    g
			//  p   u
			if (parent == grandfather->_left) {	
				Node* uncle = grandfather->_right;
				if (uncle && uncle->_col == RED) //叔叔存在并且为红
				{
					parent->_col = uncle->_col = BLACK;
					grandfather->_col = RED;
 
					cur = grandfather;
					parent = cur->_parent; //往上面走
				}
				else
				{
					//u存在且为黑或不存在 ->变色再继续往上处理 + 变色
					if (cur == parent->_left) { //cur存在那么cur一定为红色 
 
						//    g
						//  p   u
						//c
						//单旋，把p旋转上去，p作为子树根节点，g作为p的右
						RotateR(grandfather);
						parent->_col = BLACK;
						grandfather->_col = RED;
					}
					else
					{
						//    g
						//  p   u
						//    c
						//双旋，将cur旋转上去，p作为cur的左，然后再旋转把cur旋转上去，g作为cur右边
						RotateL(parent);
						RotateR(grandfather);
 
						cur->_col = BLACK;
						grandfather->_col = RED;
					}
					break;
				}
			}
			else
			{
				//    g
				//  u   p
				Node* uncle = grandfather->_left;
				// 叔叔存在且为红，-》变色即可
				if (uncle && uncle->_col == RED)
				{
					parent->_col = uncle->_col = BLACK;
					grandfather->_col = RED;
 
					// 继续往上处理
					cur = grandfather;
					parent = cur->_parent;
				}
				else // 叔叔不存在，或者存在且为黑
				{
					// 情况二：叔叔不存在或者存在且为黑
					// 旋转+变色
					//      g
					//   u     p
					//            c
					if (cur == parent->_right)
					{
						RotateL(grandfather);
						parent->_col = BLACK;
						grandfather->_col = RED;
					}
					else
					{
						//		g
						//   u     p
						//      c
						RotateR(parent);
						RotateL(grandfather);
						cur->_col = BLACK;
						grandfather->_col = RED;
					}
					break;
				}
			}
		}
 
		_root->_col = BLACK; //无论什么情况根节点都为黑
 
		return make_pair(Iterator(newnode,_root), true);
	}
 
	void InOrder()
	{
		_InOrder(_root);
		cout << endl;
	}
 
	int Height()
	{
		return _Height(_root);
	}
 
	int Size()
	{
		return _Size(_root);
	}
 
 
	bool IsBalance()
	{
		if (_root == nullptr)
			return true;
 
		if (_root->_col == RED) 
		{
			return false;
		}
 
		// 随便找条路径作为参考值
		int refNum = 0;
		Node* cur = _root;
		while (cur)
		{
			if (cur->_col == BLACK)
			{
				++refNum;
			}
			cur = cur->_left;
		}
 
		return Check(_root, 0, refNum);
	}
 
	Iterator* 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 Iterator(cur, _root);
			}
		}
		return End();
	}
 
 
private:
	bool Check(Node* root, int blackNum, const int refNum)
	{
		if (root == nullptr)
		{
			//cout << blackNum << endl;
			if (refNum != blackNum)
			{
				cout << "存在黑色节点的数量不相等的路径" << endl;
				return false;
			}
			return true;
		}
 
		if (root->_col == RED && root->_parent->_col == RED)
		{
			cout << root->_kv.first << "存在连续的红色节点" << endl;
			return false;
		}
 
		if (root->_col == BLACK)
		{
			blackNum++;
		}
 
		return Check(root->_left, blackNum, refNum)
			&& Check(root->_right, blackNum, refNum);
	}
 
 
	int _Size(Node* root)
	{
		return root == nullptr ? 0 : _Size(root->_left) + _Size(root->_right) + 1;
	}
 
	int _Height(Node* root)
	{
		if (root == nullptr)
			return 0;
 
		int leftHeight = _Height(root->_left);
		int rightHeight = _Height(root->_right);
 
		return leftHeight > rightHeight ? leftHeight + 1 : rightHeight + 1;
	}
 
	void _InOrder(Node* root)
	{
		if (root == nullptr)
		{
			return;
		}
 
		_InOrder(root->_left);
		cout << root->_kv.first << ":" << root->_kv.second << endl;
		_InOrder(root->_right);
	}
 
	void RotateL(Node* parent)
	{
		_rotateNum++;
		Node* subR = parent->_right;
		Node* subRL = subR->_left;
 
		parent->_right = subRL;
		if (subRL)
			subRL->_parent = parent;
 
		Node* parentParent = parent->_parent;
 
		subR->_left = parent;
		parent->_parent = subR;
 
		if (parentParent == nullptr)
		{
			_root = subR;
			subR->_parent = nullptr;
		}
		else
		{
			if (parent == parentParent->_left)
			{
				parentParent->_left = subR;
			}
			else
			{
				parentParent->_right = subR;
			}
 
			subR->_parent = parentParent;
		}
	}
 
	void  RotateR(Node* parent)
	{
		_rotateNum++;
		Node* subL = parent->_left;
		Node* subLR = subL->_right;
 
		parent->_left = subLR;
		if (subLR)
			subLR->_parent = parent;
 
		Node* parentParent = parent->_parent;
 
		subL->_right = parent;
		parent->_parent = subL;
 
		if (parentParent == nullptr)
		{
			_root = subL;
			subL->_parent = nullptr;
		}
		else
		{
			if (parent == parentParent->_left)
			{
				parentParent->_left = subL;
			}
			else
			{
				parentParent->_right = subL;
			}
 
			subL->_parent = parentParent;
		}
	}
 
	void Destroy(Node* root)
	{
		if (root == nullptr)
			return;
 
		Destroy(root->_left);
		Destroy(root->_right);
		delete root;
	}
 
	Node* Copy(Node* root)
	{
		if (root == nullptr) return nullptr;
 
		Node* newRoot = new Node(root->_kv);
		newRoot->_left = Copy(root->_left);
		newRoot->_right = Copy(root->_right);
 
		return newRoot;
	}
 
private:
	Node* _root = nullptr;
 
public:
	int _rotateNum = 0;
};
 
 
 

​