搜索资源列表
rbtree
- 关于红黑树的很好c++的实现，可以直接使用或者作为实现参考。-On the red-black tree implementation of a good c++ can be used directly or as a realization of reference.
RedAndBlackBinaryTree
- 自己编写的数据结构中的红黑树的实现，包括各种生成，添加，删除等各种操作-Own C program of data structure s red-black tree implementation, including generation, add, delete and other operations
RedBlackTree
- 红黑树、二叉搜索树的实现和性能比较。因为实验要求指定了输入哪些数据，所以在实现时我用了一个数组将所有的数据保存到内存里，然后直接调用插入和删除操作，这样就不再需要用户输入数据，省去了输入数据的麻烦。删除操作也是在程序里直接调用的，不要用户输入。-red black tree
CRBTree
- Red Black Tree ,an important part of IT.
RBTree
- mfc 用宽度优先算法动态显示红黑树，数据随机生成-Red-Black Tree
RBtree
- 红黑树的运用，以红黑树作为数据结构实现排序算法，其中实现了红黑树的生成和旋转。-The use of red-black tree, to red-black tree data structure to achieve a sorting algorithm, which implements red-black tree formation and rotation.
keshe5
- 红黑树的建立，查找，左旋，右旋。课程设计时做的。希望给大家个参考-Red-black tree establishment, look, L, D. Courses designed to do. Want to give you a reference
RBtree
- 红黑树的实现 经过严格测试，保证正确，暂时只实现插入没有删除-Red-black tree implementation of rigorous testing to ensure the right moment not only to achieve insertion deletion
removeRBTee
- 在VC++6.0编译器环境下完成红黑树的删除，基于C++源码的编程 直接新建满足条件的红黑树，然后删除选定的结点-In VC++6.0 compiler environment to complete the removal of red-black tree, based on C++ source code directly to the new programming to meet the conditions of the red-black tree, and then delete
Red_black_Tree
- 标准关联容器是由红黑树实现的，因此非常重要。-Standard red-black tree from the container associated with implementation, and therefore very important.
PRBtree
- 使用C++建立了红黑树，内部含有红黑树所需要的各类函数~很好很强大-Using C++ built red-black tree, the tree-house with red and black all need a good powerful function ~
1
- Red Black Tree code in Java
2
- Red Black Tree in Java
josephus
- 利用红黑树结构来实现的josephus排列，复杂度为o（nlogn）-Red-black tree structure used to achieve the josephus arrangement
multiple_tree
- 根据kurse版数据结构改成的课程文档。此章包括内容：B树，Tries 树，Red-Black树。-According to kurse version of the data structure into the curriculum document. This chapter covers: B tree, Tries tree, Red-Black tree.
rbinsert
- 红黑树的插入算法实现，利用算法导论中的伪代码-Red-black tree insertion algorithm, using pseudocode in Introduction to Algorithms
rebblacktree
- 红黑树的实现，如何增加删除节点等，以及代码测试。-Red-black tree implementation, how to increase the delete node, as well as code testing.
RBTree
- 红黑树的JAVA实现。红黑树仍然不是平衡树，但是统计性能要好于AVL树。要保持红黑树的规则，主要通过两类操作，一类是换色，一类还是旋转。-JAVA red-black tree implementation. Red-black tree is still not balanced tree, but the statistical performance is better than the AVL tree. Red-black tree to keep the rules, mainly
Red_Black_Tree
- 用java来实现的红黑树算法，包括红黑树的结点建立和插入。-Use java to implement red-black tree algorithms, including the establishment of red-black tree node and inserts.
Exp8_RedBlackTree
- 数据结构实验：红黑树-Experimental data structures: red-black tree ~~~~~~~~~~~~~~~