用c++实现红黑树的判断、插入、遍历操作

红黑树


       红黑树是一棵二叉搜索树,它在每个节点上增加了一个存储位来表示节点的颜色,可以是Red或Black。通过对任何一条从根到叶子简单路径上的颜色来约束,红黑树保证最长路径不超过最短路径的两倍,因而近似于平衡。


红黑树是满足下面红黑性质的二叉搜索树:
1. 每个节点,不是红色就是黑色的;
2. 根节点是黑色的;
3. 如果一个节点是红色的,则它的两个子节点是黑色的;
4. 对每个节点,从该节点到其所有后代叶节点的简单路径上,均包含相同数目的黑色节点;
5. 每个叶子节点都是黑色的(这里的叶子节点是指的空节点)


思考:为什么满足上面的颜色约束性质,红黑树能保证最长路径不超过最短路径的两倍?

如图:所能增加的红节点数最多和黑节点数目一样多,故红黑树能保证最长路径不超过最短路径的两倍。



一、判断是否是红黑树:

//判断是否是红黑树
	bool isRBTree()
	{
		int BlackNodeNum = 0;
		int curBlackNodeNum = 0;
		Node* cur = _root;

		while (cur)
		{
			if (cur->_col == BLACK)
			{
				BlackNodeNum++;
			}

			cur = cur->_left;
		}
		return _isRBTree(_root, BlackNodeNum, curBlackNodeNum);
	}


bool _isRBTree(Node* root, int BlackNodeNum, int curBlackNodeNum)
	{
		if (root == NULL)
		{
			return true;
		}

		if (root->_col == BLACK)
		{
			curBlackNodeNum++;
		}

		if (BlackNodeNum == curBlackNodeNum)
		{
			if (root->_parent == NULL)
			{
				return true;
			}
			else if (root->_col == RED && root->_col == root->_parent->_col)
			{
				return false;
			}
			else
			{
				return true;
			}
		}

		return _isRBTree(root->_left, BlackNodeNum, curBlackNodeNum) && _isRBTree(root->_right, BlackNodeNum, curBlackNodeNum);
	}

二、红黑树的中序遍历:

//中序遍历
	void InOrder()
	{
		_InOrder(_root);
	}

void _InOrder(Node* root)
	{
		if (root == NULL)
		{
			return;
		}

		_InOrder(root->_left);
		cout << root->_key << " ";
		_InOrder(root->_right);
	}


三、左单旋

//左单旋
	void RotateL(Node*& parent)
	{
		Node* subR = parent->_right;
		Node* subRL = subR->_left;

		parent->_right = subRL;
		if (subRL)
		{
			subRL->_parent = parent;
		}

		subR->_left = parent;
		subR->_parent = parent->_parent;
		parent->_parent = subR;
		parent = subR;

		if (parent->_parent == NULL)
		{
			_root = parent;
		}
		else if (parent->_parent->_key > parent->_key)
		{
			parent->_parent->_left = parent;
		}
		else if ( parent->_parent->_key<parent->_key )
		{
			parent->_parent->_right = parent;
		}
	}


四、右单旋

//右单旋
	void RotateR(Node*& parent)
	{
		Node* subL = parent->_left;
		Node* subLR = subL->_right;

		parent->_left = subLR;
		if (subLR)
		{
			subLR->_parent = parent;
		}

		subL->_right = parent;
		subL->_parent = parent->_parent;
		parent->_parent = subL;

		parent = subL;

		if (parent->_parent == NULL)
		{
			_root = parent;
		}
		else if (parent->_parent->_key > parent->_key)
		{
			parent->_parent->_left = parent;
		}
		else if (parent->_parent->_key < parent->_key)
		{
			parent->_parent->_right = parent;
		}

	}

五、插入的三种情况
       ps:cur为当前节点,p为父节点,g为祖父节点,u为叔叔节点
1.第一种情况
    cur为红,p为红,g为黑,u存在且为红,则将p,u改为黑,g改为红,然后把g当成cur,继续向上调整。




2.第二种情况
   cur为红,p为红,g为黑,u不存在/u为黑
   p为g的左孩子,cur为p的左孩子,则进行右单旋转;相反,p为g的右孩子,cur为p的右孩子,则进行左单旋转,p、g变色--p变黑,g变红


3.第三种情况
   cur为红,p为红,g为黑,u不存在/u为黑
   p为g的左孩子,cur为p的右孩子,则针对p做左单旋转;相反,p为g的右孩子,cur为p的左孩子,则针对p做右单旋转,则转换成了情况2


    上面已经把每种情况基本列出来了,其他相反的情况类似,反过来写一下就行了,具体详细过程参考代码。

//红黑树的插入操作
	bool Insert(const K& key, const V& value)
	{
		if (_root == NULL)
		{
			_root = new Node(key, value);
			_root->_col = BLACK;
			return true;
		}

		Node* parent = NULL;
		Node* cur = _root;
		while (cur)
		{
			if (cur->_key > key)
			{
				parent = cur;
				cur = cur->_left;
			}
			else if (cur->_key < key)
			{
				parent = cur;
				cur = cur->_right;
			}
			else
			{
				return false;
			}
		}

		//插入位置  
		if (parent->_key >key)
		{
			cur = new Node(key, value);
			parent->_left = cur;
			cur->_parent = parent;
		}
		else if (parent->_key < key)
		{
			cur = new Node(key, value);
			parent->_right = cur;
			cur->_parent = parent;
		}

		//插入以后,进行调整  
		while (cur != _root && parent->_col == RED)
		{
			Node* grandfather = parent->_parent;
			Node* uncle = NULL;
			//左边的情况  
			if (parent == grandfather->_left)
			{
				//情况一  
				uncle = grandfather->_right;
				if (uncle && uncle->_col == RED)
				{
					//1. 不需要旋转  
					if (cur == parent->_left)
					{
						grandfather->_col = RED;
						parent->_col = BLACK;
						uncle->_col = BLACK;

						cur = grandfather;
						parent = cur->_parent;
					}

					//2.需要旋转  
					else if (cur == parent->_right)
					{
						RotateL(parent);
						grandfather->_col = RED;
						parent->_col = BLACK;
						uncle->_col = BLACK;

						cur = grandfather;
						parent = cur->_parent;
					}

				}

				//情况二,三 
				else if (uncle == NULL || (uncle && uncle->_col == BLACK))
				{
					if (cur == parent->_right)
					{
						RotateL(parent);
					}
					parent->_col = BLACK;
					grandfather->_col = RED;
					RotateR(grandfather);
					break;
				}
			}
			//右边的情况  
			else if (parent == grandfather->_right)
			{
				//情况一
				uncle = grandfather->_left;
				if (uncle && uncle->_col == RED)
				{
					//1.不需要旋转  
					if (cur == parent->_right)
					{
						uncle->_col = BLACK;
						grandfather->_col = RED;
						parent->_col = BLACK;

						cur = grandfather;
						parent = cur->_parent;
					}

					//2.需要旋转  
					else if (cur == parent->_left)
					{
						uncle->_col = BLACK;
						grandfather->_col = RED;
						parent->_col = BLACK;
						RotateR(parent);

						cur = grandfather;
						parent = cur->_parent;
					}
				}
				//情况二,三
				else if (uncle == NULL || (uncle && uncle->_col == BLACK))
				{
					if (cur == parent->_left)
					{
						RotateR(parent);
					}
					parent->_col = BLACK;
					grandfather->_col = RED;
					RotateL(grandfather);
					break;
				}
			}
		}
		_root->_col = BLACK;
		return true;
	}

红黑树和AVL树的比较:


       红黑树和AVL树都是高效的平衡二叉树,增删查改的时间复杂度都是O(lg(N)),红黑树的不追求完全平衡,保证最长路径不超过最短路径的2倍,相对而言,降低了旋转的要求,所以性能会优于AVL树,所以实际运用中红黑树更多。

完整代码及测试用例:

#include<iostream>
using namespace std;

enum colour
{
	RED,
	BLACK,
};

template<class K, class V>
struct RBTreeNode
{
	int _col;
	K _key;
	V _value;
	RBTreeNode<K, V>* _left;
	RBTreeNode<K, V>* _right;
	RBTreeNode<K, V>* _parent;

	RBTreeNode(const K& key, const V& value)
		:_key(key)
		, _value(value)
		, _col(RED)
		, _left(NULL)
		, _right(NULL)
		, _parent(NULL)
	{}

};


template<class K, class V>
class RBTree
{
	typedef RBTreeNode<K, V> Node;
public:
	RBTree()
		:_root(NULL)
	{}

	//红黑树的插入操作
	bool Insert(const K& key, const V& value)
	{
		if (_root == NULL)
		{
			_root = new Node(key, value);
			_root->_col = BLACK;
			return true;
		}

		Node* parent = NULL;
		Node* cur = _root;
		while (cur)
		{
			if (cur->_key > key)
			{
				parent = cur;
				cur = cur->_left;
			}
			else if (cur->_key < key)
			{
				parent = cur;
				cur = cur->_right;
			}
			else
			{
				return false;
			}
		}

		//插入位置  
		if (parent->_key >key)
		{
			cur = new Node(key, value);
			parent->_left = cur;
			cur->_parent = parent;
		}
		else if (parent->_key < key)
		{
			cur = new Node(key, value);
			parent->_right = cur;
			cur->_parent = parent;
		}

		//插入以后,进行调整  
		while (cur != _root && parent->_col == RED)
		{
			Node* grandfather = parent->_parent;
			Node* uncle = NULL;
			//左边的情况  
			if (parent == grandfather->_left)
			{
				//情况一  
				uncle = grandfather->_right;
				if (uncle && uncle->_col == RED)
				{
					//1. 不需要旋转  
					if (cur == parent->_left)
					{
						grandfather->_col = RED;
						parent->_col = BLACK;
						uncle->_col = BLACK;

						cur = grandfather;
						parent = cur->_parent;
					}

					//2.需要旋转  
					else if (cur == parent->_right)
					{
						RotateL(parent);
						grandfather->_col = RED;
						parent->_col = BLACK;
						uncle->_col = BLACK;

						cur = grandfather;
						parent = cur->_parent;
					}

				}

				//情况二,三 
				else if (uncle == NULL || (uncle && uncle->_col == BLACK))
				{
					if (cur == parent->_right)
					{
						RotateL(parent);
					}
					parent->_col = BLACK;
					grandfather->_col = RED;
					RotateR(grandfather);
					break;
				}
			}
			//右边的情况  
			else if (parent == grandfather->_right)
			{
				//情况一
				uncle = grandfather->_left;
				if (uncle && uncle->_col == RED)
				{
					//1.不需要旋转  
					if (cur == parent->_right)
					{
						uncle->_col = BLACK;
						grandfather->_col = RED;
						parent->_col = BLACK;

						cur = grandfather;
						parent = cur->_parent;
					}

					//2.需要旋转  
					else if (cur == parent->_left)
					{
						uncle->_col = BLACK;
						grandfather->_col = RED;
						parent->_col = BLACK;
						RotateR(parent);

						cur = grandfather;
						parent = cur->_parent;
					}
				}
				//情况二,三
				else if (uncle == NULL || (uncle && uncle->_col == BLACK))
				{
					if (cur == parent->_left)
					{
						RotateR(parent);
					}
					parent->_col = BLACK;
					grandfather->_col = RED;
					RotateL(grandfather);
					break;
				}
			}
		}
		_root->_col = BLACK;
		return true;
	}

	//判断是否是红黑树
	bool isRBTree()
	{
		int BlackNodeNum = 0;
		int curBlackNodeNum = 0;
		Node* cur = _root;

		while (cur)
		{
			if (cur->_col == BLACK)
			{
				BlackNodeNum++;
			}

			cur = cur->_left;
		}
		return _isRBTree(_root, BlackNodeNum, curBlackNodeNum);
	}

	//中序遍历
	void InOrder()
	{
		_InOrder(_root);
	}

protected:
	bool _isRBTree(Node* root, int BlackNodeNum, int curBlackNodeNum)
	{
		if (root == NULL)
		{
			return true;
		}

		if (root->_col == BLACK)
		{
			curBlackNodeNum++;
		}

		if (BlackNodeNum == curBlackNodeNum)
		{
			if (root->_parent == NULL)
			{
				return true;
			}
			else if (root->_col == RED && root->_col == root->_parent->_col)
			{
				return false;
			}
			else
			{
				return true;
			}
		}

		return _isRBTree(root->_left, BlackNodeNum, curBlackNodeNum) && _isRBTree(root->_right, BlackNodeNum, curBlackNodeNum);
	}


	void _InOrder(Node* root)
	{
		if (root == NULL)
		{
			return;
		}

		_InOrder(root->_left);
		cout << root->_key << " ";
		_InOrder(root->_right);
	}

	//左单旋
	void RotateL(Node*& parent)
	{
		Node* subR = parent->_right;
		Node* subRL = subR->_left;

		parent->_right = subRL;
		if (subRL)
		{
			subRL->_parent = parent;
		}

		subR->_left = parent;
		subR->_parent = parent->_parent;
		parent->_parent = subR;
		parent = subR;

		if (parent->_parent == NULL)
		{
			_root = parent;
		}
		else if (parent->_parent->_key > parent->_key)
		{
			parent->_parent->_left = parent;
		}
		else if ( parent->_parent->_key<parent->_key )
		{
			parent->_parent->_right = parent;
		}
	}

	//右单旋
	void RotateR(Node*& parent)
	{
		Node* subL = parent->_left;
		Node* subLR = subL->_right;

		parent->_left = subLR;
		if (subLR)
		{
			subLR->_parent = parent;
		}

		subL->_right = parent;
		subL->_parent = parent->_parent;
		parent->_parent = subL;

		parent = subL;

		if (parent->_parent == NULL)
		{
			_root = parent;
		}
		else if (parent->_parent->_key > parent->_key)
		{
			parent->_parent->_left = parent;
		}
		else if (parent->_parent->_key < parent->_key)
		{
			parent->_parent->_right = parent;
		}

	}

protected:
	Node* _root;
};


void TestRBtree()
{
	RBTree<int, int>RBT;
	int arr[10]= { 1, 2,5, 12, 16, 18, 26, 3, 99,666 };

	for (int i = 0; i < 10; i++)
	{
		RBT.Insert(arr[i], i);
	}
	
	RBT.InOrder();
	cout << endl;

	cout << "isRBTree? ->:" << RBT.isRBTree() << endl;

}

int main()
{
	TestRBtree();
	system("pause");
	return 0;
}

运行结果:
1 2 3 5 12 16 18 26 99 666
isRBTree? ->:1
请按任意键继续. . .
  • 1
    点赞
  • 24
    收藏
    觉得还不错? 一键收藏
  • 2
    评论
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值