高性能组件-红黑树-C语言版本

高性能编程组件之红黑树

1、列举下红黑树的一些应用场景

① hashmap：例如C++标准库当中的set和map是基于红黑树来实现的。

②cfs (进程调度器)：在优先级调度这一策略中，每一个进程都享有不同的优先级。CPU的调度器会按照不同的调度器将进程调度到CPU执行，所有的进程，实际上是有红黑树来组织的。CPU按中序遍历的方式选择进程进行调度。

③EPOLL：EPOLL之所以能做到高性能的网络通知。是因为所有的SOCKET全部被寄存到了红黑树当中的节点上，所以无论是增加SOCKET节点，还是调用CLOSE删除SOCKET节点，效率都非常高。当网络数据到来后，内核能以O(log n)的时间复杂度进行网络事件SOCKET的查找（最常用的就是可读事件，实际上，对于服务器的连接，数据抵达，网络断线来说，都是可读事件。）

④定时器：对于高性能服务器实现心跳机制，游双的服务器编程中提到了两种实现方式，最小堆和时间轮的方法。

最小堆可以采用红黑树来替换（看个人心情吧，最小堆也是O（logn）,除了扩容的内存拷贝之外，没有其他性能消耗，没必要为这点性能使用更加复杂庞大的红黑树，毕竟要自己实现红黑树的话太复杂了。）。

⑤nginx：nginx当中的定时器组件就是以红黑树为基础结构来搭建的。

2、红黑树在业务应用上有两种场景：

① 高性能的查询服务，适用于 key - value 的业务场景。通过key可以用时间复杂度O(logn)的效率查找到对应的value，例如下图的中。每一个资源会记录当前的访问数，那么就可以采用红黑树来实现，资源ID作为key，访问数作为value。
在这里插入图片描述

② 对于服务器的业务编程上，常用的做法是给不同的业务数据包绑定一个ID（一般会将数据包的ID值写到包头位置），服务器通过不同的ID对业务数据包进行判断，分发到不同的业务模块。通常服务器中会给每一个ID绑定一个处理函数，由此可以实现高性能的业务数据分发。

using function = void(*)(...) // ...填写业务所使用到的参数
map<int,function> funcHander; // 服务器当中常用的事件分发器

3、红黑树的一些基本性质

①每个节点是红的或者黑的

②根节点是黑色的

③每个叶子节点是黑色的

④如果有一个红色节点，那么两个儿子节点都是黑色

⑤对每一个节点，从该节点到子孙节点的所有路径包含相同的黑色节点。

C语言版本，手撕红黑树代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define RED				1
#define BLACK 			2
typedef int KEY_TYPE;
typedef struct _rbtree_node {
	unsigned char color;
	struct _rbtree_node *right;
	struct _rbtree_node *left;
	struct _rbtree_node *parent;
	KEY_TYPE key;
	void *value;
} rbtree_node;

typedef struct _rbtree {
	rbtree_node *root;
	rbtree_node *nil;
} rbtree;

rbtree_node *rbtree_mini(rbtree *T, rbtree_node *x) {
	while (x->left != T->nil) {
		x = x->left;
	}
	return x;
}

rbtree_node *rbtree_maxi(rbtree *T, rbtree_node *x) {
	while (x->right != T->nil) {
		x = x->right;
	}
	return x;
}

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;
}


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; //1 1
	if (y->left != T->nil) { //1 2
		y->left->parent = x;
	}
	y->parent = x->parent; //1 3
	if (x->parent == T->nil) { //1 4
		T->root = y;
	} else if (x == x->parent->left) {
		x->parent->left = y;
	} else {
		x->parent->right = y;
	}
	y->left = x; //1 5
	x->parent = y; //1 6
}


void rbtree_right_rotate(rbtree *T, rbtree_node *y) {
	rbtree_node *x = y->left;
	y->left = x->right;
	if (x->right != T->nil) {
		x->right->parent = y;
	}
	x->parent = y->parent;
	if (y->parent == T->nil) {
		T->root = x;
	} else if (y == y->parent->right) {
		y->parent->right = x;
	} else {
		y->parent->left = x;
	}
	x->right = y;
	y->parent = 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) {
				z->parent->color = BLACK;
				y->color = BLACK;
				z->parent->parent->color = RED;
				z = z->parent->parent; //z --> RED
			} else {
				if (z == z->parent->right) {
					z = z->parent;
					rbtree_left_rotate(T, z);
				}
				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;
	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_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, KEY_TYPE 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;
}


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");
	}	
}