红黑树的完整代码实现。按照算法导论给出的算法。附二叉查找树的完整代码。纯C语言实现。

AVL和红黑树性能对比，有详细的测试数据。AVL和红黑树都是平衡树。 Binary search tree (BST) based data structures, such as AVL trees, red-black trees, and splay trees, are often used in system software, such as operating system kernels. Choosing the right kind of tree can impact performance significantly, but the literature offers few empirical studies for guidance. We compare 20 BST variants using three experiments in real-world scenarios with real and artificial workloads. The results indicate that when input is expected to be randomly ordered with occasional runs of sorted order, red-black trees are preferred; when insertions often occur in sorted order, AVL trees excel for later random access, whereas splay trees perform best for later sequential or clustered access. For node representations, use of parent pointers is shown to be the fastest choice, with threaded nodes a close second choice that saves memory; nodes without parent pointers or threads suffer when traversal and modification are combined; maintaining a in-order doubly linked list is advantageous when traversal is very common; and right-threaded nodes perform poorly.

完整实现二叉搜索树，红黑树，AVL平衡树，B树的搜索插入删除基本功能和其它功能。红黑树和B树参考自算法导论。

中国科学技术大学的算法课程，红黑树插入算法实验报告

红黑树的完整实现（C++）模板类；已测试使用完毕。参考《STL源码剖析》《算法导论》

红黑树的C语言代码实现，这我参考《算法导论》写的实例代码，仅供参考^_^

控制台打印红黑树

红黑树C++代码实现

JAVA实现的红黑树，具有查找插入删除功能

中科大算法导论实验包括代码、报告和可执行文件。 1.（必做题） 常见排序算法的实现与性能比较 2. (必做题） 红黑树、二叉搜索树的实现和性能比较 3.(选做题） 最长递增子序列