红黑树和AVL树的实现

#include <stdio.h> #include <stdlib.h> #include "rb_tree.h" void swap(int *x, int *y) { int temp; temp = *x; *x = *y; *y = temp; } int main() { int i = 0; int n = 20; int w; int num[20]; int path[20]; //声明并初始化红黑树 rbtree *t; init_rb(t); //随机生成20个关键字 for (i = 0; i < n; i++) { num[i] = i + 1; } srand(time(0)); for( i = 0; i < n; i++ ) { w = rand() % (n-i) + i; swap(&num[i], &num[w]); } //插入操作 printf("+++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("依次插入关键字：\n"); for( i = 0; i < n; i++) { rb_insert(t, num[i]); printf("%d ",num[i]); } printf("\n+++++++++++++++++++++++++++++++++++++++++++++++++\n"); printf("\n"); display(t, t->head, 0); printf("所有路径对应的黑高度：\n"); find_path_bh(t, t->head, 0, path, 0); printf("+++++++++++++++++++++++++++++++++++++++++++++++++\n"); //删除操作，随机删除3个关键字 printf("随机删除三个关键字：\n"); srand(time(0)); for( i = 0; i < 3; i++ ) { w = rand() % (n-i) + i; printf("%d ",num[w]); rb_delete(t, num[w]); } printf("\n+++++++++++++++++++++++++++++++++++++++++++++++++\n"); display(t, t->head, 0); printf("所有路径对应的黑高度：\n"); find_path_bh(t, t->head, 0, path, 0); rb_destroy(t->head); return 0; }