高级数据结构--红黑树

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define RED	1
#define BLACK 2

//结构体声明
//节点定义
typedef struct _rbtree_node 
{
	unsigned char color; //节点的颜色
	struct _rbtree_node* right; //右子树
	struct _rbtree_node* left; //左子树
	struct _rbtree_node* parent; //父节点
	int key;
	void* value;
} rbtree_node;

typedef struct _rbtree 
{
	rbtree_node* root; //根节点 
	rbtree_node* nil; //NULL空节点
} rbtree;

//查询红黑树最小的key对应的节点
rbtree_node* rbtree_mini(rbtree* T, rbtree_node* x) 
{
	while (x->left != T->nil) 
	{
		x = x->left;
	}
	return x;
}

//查询红黑树最大的key对应的节点
rbtree_node* rbtree_maxi(rbtree* T, rbtree_node* x) 
{
	while (x->right != T->nil) 
	{
		x = x->right;
	}
	return x;
}

//左旋
void rbtree_left_rotate(rbtree* T, rbtree_node* x) 
{

	rbtree_node* y = x->right; // x  --> y  ,  y --> x,   right --> left,  left --> right

	x->right = y->left; //将y的左子树变成x的右子树
	if (y->left != T->nil) //如果y的左子树不是NULL，将它的父亲节点变成x
	{
		y->left->parent = x;
	}

	y->parent = x->parent; //将y的父亲节点改成x的父亲节点
	if (x->parent == T->nil) //如果x为根节点
	{
		T->root = y;
	}
	else if (x == x->parent->left) //如果x是x父亲节点的左节点
	{
		x->parent->left = y;
	}
	else //如果x是x父亲节点的右节点
	{
		x->parent->right = y;
	}

	y->left = x; //y的左子树为x
	x->parent = y; //x的父亲节点为y
}

//右旋
void rbtree_right_rotate(rbtree* T, rbtree_node* y) 
{

	rbtree_node* x = y->left;

	y->left = x->right; //将x的右子树变成y的左子树
	if (x->right != T->nil) //如果x的右子树不是NULL，将它的父亲节点变成y
	{
		x->right->parent = y;
	}

	x->parent = y->parent; //将x的父亲节点改成y的父亲节点
	if (y->parent == T->nil) 
	{
		T->root = x;
	}
	else if (y == y->parent->right) //如果y是y父亲节点的右节点
	{
		y->parent->right = x;
	}
	else 
	{
		y->parent->left = x;
	}

	x->right = y; //x的右子树为y
	y->parent = x; //y的父亲节点为x
}

//插入节点后的调整操作
void rbtree_insert_fixup(rbtree* T, rbtree_node* z)
{
	while (z->parent->color == RED) //z ---> RED
	{
		if (z->parent == z->parent->parent->left) //父亲节点是祖父节点左儿子
		{
			rbtree_node* y = z->parent->parent->right; //叔父节点
			if (y->color == RED) //情况2，叔父节点红色
			{
				z->parent->color = BLACK; //叔父节点、父亲节点变成黑色，祖父节点变成红色
				y->color = BLACK;
				z->parent->parent->color = RED;

				z = z->parent->parent; //递归，z变成z的祖父节点
			}
			else
			{
				if (z == z->parent->right) //情况4，先左旋父亲节点
				{
					z = z->parent;
					rbtree_left_rotate(T, z);
				}

				//情况3
				z->parent->color = BLACK;
				z->parent->parent->color = RED;
				rbtree_right_rotate(T, z->parent->parent);
			}
		}
		else //父亲节点是祖父节点右儿子
		{
			rbtree_node* y = z->parent->parent->left;
			if (y->color == RED)
			{
				z->parent->color = BLACK;
				y->color = BLACK;
				z->parent->parent->color = RED;

				z = z->parent->parent; //z --> RED
			}
			else
			{
				if (z == z->parent->left)
				{
					z = z->parent;
					rbtree_right_rotate(T, z);
				}

				z->parent->color = BLACK;
				z->parent->parent->color = RED;
				rbtree_left_rotate(T, z->parent->parent);
			}
		}
	}

	T->root->color = BLACK; //保证根是黑色
}

//插入节点操作
void rbtree_insert(rbtree* T, rbtree_node* z) 
{
	rbtree_node* y = T->nil; //NULL节点
	rbtree_node* x = T->root; //根

	while (x != T->nil) //直到叶子节点
	{
		y = x;
		if (z->key < x->key) 
		{
			x = x->left;
		}
		else if (z->key > x->key) 
		{
			x = x->right;
		}
		else //Exist
		{ 
			return;
		}
	}

	z->parent = y;
	if (y == T->nil) //一个节点都没有的情况
	{
		T->root = z;
	}
	else if (z->key < y->key) //插入左边
	{
		y->left = z;
	}
	else //插入右边
	{
		y->right = z;
	}

	z->left = T->nil;
	z->right = T->nil;
	z->color = RED;//置位红

	rbtree_insert_fixup(T, z);//红黑树的插入调整
}

//删除后的调整操作
void rbtree_delete_fixup(rbtree* T, rbtree_node* x) 
{

	while ((x != T->root) && (x->color == BLACK)) 
	{
		if (x == x->parent->left) 
		{
			rbtree_node* w = x->parent->right;
			if (w->color == RED) 
			{
				w->color = BLACK;
				x->parent->color = RED;

				rbtree_left_rotate(T, x->parent);
				w = x->parent->right;
			}

			if ((w->left->color == BLACK) && (w->right->color == BLACK)) 
			{
				w->color = RED;
				x = x->parent;
			}
			else 
			{
				if (w->right->color == BLACK) 
				{
					w->left->color = BLACK;
					w->color = RED;
					rbtree_right_rotate(T, w);
					w = x->parent->right;
				}

				w->color = x->parent->color;
				x->parent->color = BLACK;
				w->right->color = BLACK;
				rbtree_left_rotate(T, x->parent);

				x = T->root;
			}
		}
		else 
		{
			rbtree_node* w = x->parent->left;
			if (w->color == RED)
			{
				w->color = BLACK;
				x->parent->color = RED;
				rbtree_right_rotate(T, x->parent);
				w = x->parent->left;
			}

			if ((w->left->color == BLACK) && (w->right->color == BLACK)) 
			{
				w->color = RED;
				x = x->parent;
			}
			else 
			{
				if (w->left->color == BLACK) 
				{
					w->right->color = BLACK;
					w->color = RED;
					rbtree_left_rotate(T, w);
					w = x->parent->left;
				}

				w->color = x->parent->color;
				x->parent->color = BLACK;
				w->left->color = BLACK;
				rbtree_right_rotate(T, x->parent);

				x = T->root;
			}
		}
	}

	x->color = BLACK;
}

//中序遍历的后继节点(删除节点中的操作)
rbtree_node* rbtree_successor(rbtree* T, rbtree_node* x)
{
	rbtree_node* y = x->parent;

	if (x->right != T->nil)
	{
		return rbtree_mini(T, x->right);
	}

	while ((y != T->nil) && (x == y->right))
	{
		x = y;
		y = y->parent;
	}

	return y;
}

//删除节点操作
rbtree_node* rbtree_delete(rbtree* T, rbtree_node* z) 
{
	rbtree_node* y = T->nil;
	rbtree_node* x = T->nil;

	if ((z->left == T->nil) || (z->right == T->nil)) 
	{
		y = z;
	}
	else 
	{
		y = rbtree_successor(T, z);
	}

	if (y->left != T->nil) 
	{
		x = y->left;
	}
	else if (y->right != T->nil) 
	{
		x = y->right;
	}

	x->parent = y->parent;
	if (y->parent == T->nil) 
	{
		T->root = x;
	}
	else if (y == y->parent->left) 
	{
		y->parent->left = x;
	}
	else 
	{
		y->parent->right = x;
	}

	if (y != z) 
	{
		z->key = y->key;
		z->value = y->value;
	}

	if (y->color == BLACK) 
	{
		rbtree_delete_fixup(T, x);
	}

	return y;
}

//查找操作
rbtree_node* rbtree_search(rbtree* T, int key) 
{
	rbtree_node* node = T->root;
	while (node != T->nil) 
	{
		if (key < node->key) 
		{
			node = node->left;
		}
		else if (key > node->key) 
		{
			node = node->right;
		}
		else 
		{
			return node;
		}
	}
	return T->nil; //返回NULL节点
}

//中序遍历
void rbtree_traversal(rbtree* T, rbtree_node* node) 
{
	if (node != T->nil) 
	{
		rbtree_traversal(T, node->left);
		printf("key:%d, color:%d\n", node->key, node->color);
		rbtree_traversal(T, node->right);
	}
}


//主函数
int main() 
{
	int keyArray[20] = { 24,25,13,35,23, 26,67,47,38,98, 20,19,17,49,12, 21,9,18,14,15 };

	rbtree* T = (rbtree*)malloc(sizeof(rbtree));
	if (T == NULL) 
	{
		printf("malloc failed\n");
		return -1;
	}

	T->nil = (rbtree_node*)malloc(sizeof(rbtree_node));
	T->nil->color = BLACK;
	T->root = T->nil;

	rbtree_node* node = T->nil;

	int i = 0;
	for (i = 0; i < 20; i++) 
	{
		node = (rbtree_node*)malloc(sizeof(rbtree_node));
		node->key = keyArray[i];
		node->value = NULL;

		rbtree_insert(T, node);
	}

	rbtree_traversal(T, T->root);
	printf("=========================================\n");

	for (i = 0; i < 20; i++) 
	{
		rbtree_node* node = rbtree_search(T, keyArray[i]);
		rbtree_node* cur = rbtree_delete(T, node);
		free(cur);

		rbtree_traversal(T, T->root);
		printf("=========================================\n");
	}
}