搜索资源列表
排序算法、字典和B-树的C++语言实现
- 排序算法、字典和B-树的C++语言实现 代码内容 包括以下算法： qui.c sort: quicksort qsort.c sort: qsort ins.c sort: insert sort shl.c sort: shell sort has.c dictionary: hash tables bin.c dictionary: binary tree rbt.c dictionary: red-black trees skl.c dic
test1
- map映照容器的元素数据由一个键值和一个映照数据组成的，他也是采用红黑树实现，插入元素的键值不允许重复，默认从小到大排-Map of the container element data from the shine upon a key value and a mapping data of composition, he is also using red and black tree realization, the elements of the key value not allowe
RBtree
- VC6++的红黑树结点插入的建树法，可以直接运行-VC6++ The red and black tree node inserted Jianshu law, can be directly run
rbtree.tar
- 关于红黑树的数据结构和所有重要的操作，用C++编写，在linux用g++编译。附有实验报告-The structure and operation of all important data on red-black tree with C++ written in linux with g++ compilation. With test report
kernel-list-rbtree
- LINUX 红黑树内核知识测试 ... -Red-black tree LINUX kernel knowledge test ...
c
- 区间树，创建区间树，插入删除和搜索操作。 红黑树创建查询删除。 二分查找，多种排序方式实现，快速矩阵运算实现-Interval trees, create a range of trees, insert and delete search operation. Create a query remove red-black tree. Binary search, sorting various ways, matrix operations to achieve fast
05_RBT
- 红黑树的创建插入与删除的具体源代码的实现-Achieve red-black tree create insertion and deletion of specific implementation code
DirsWatcher
- linux多文件目录监控源码，采用红黑树来存储数据结构，方便随机方面及修改。-linux multiple files directory monitor source, using red-black tree data structure to store, easy to modify and stochastic aspects.
RedBlackTree
- 实现有效的红黑树插入算法.java实现，编译环境MyEclipse -Implement effective method of inserting a red-black tree. Java implementation, compile environment is MyEclipse
red_black_tree
- C语言实现的红黑树，实现了插入、删除、查找、rank-red black tree in c
RedBlackTree
- 数据结构与算法中很重要的红黑树，基于C语言实现-Data Structures and Algorithms very important red-black tree, based on the C language
project
- 中国科大gnj教授算法导论实验二红黑树的源代码，可以参考下，主要根据算法导论课本的伪代码实现-China HKUST professor gnj Introduction to experiment two red-black tree algorithm source code, you can refer to, mainly based algorithms textbook Introduction to pseudo-code
RB_Tree_danciking
- 使用红黑树编写“背单词”应用，根据熟悉度进行排序，熟悉度相同根据字典序排序。可添加，删除单词，也可以修改单词的熟悉度。可查找第k个单词，或计算kth到lth的单词熟悉度综合。-Use red-black tree to write " back the word" application, based on familiarity sort of familiarity same lexicographically sorted. You can add, delete wor
RedBlackTree
- 自己使用C++实现的一个简单的红黑树，可用codeblocks直接打开(Own simple red black tree)
新建文本文档
- 红黑树的查找和插入功能的实现。。。。。。。。。。。(The implementation of the red black tree search and insertion function.)
rbtree
- 用C++实现的红黑树，没有BUG ，稍微改改就能直接运行了，最优的代码了，拿去研究吧，也没什么可以说的了···(C++ with the red black tree, no BUG, little changes can be directly run, the optimal code, to study it, nor what to say..)
rbTree
- 用C语言实现红黑树基本操作，rbTree.h为定义了函数的头文件，rbTree.cpp可用来测试(code for basic operations of Red/Black Tree)
STL
- 源码之前了无秘密，你将看到vector的实现、list的实现、heap的实现、deque的实现、Red Black tree的实现、hash table的实现、set/map的实现;你将看到各种算法(排序、查找、排列组合、数据移动与复制技术)的实现;你甚至能够看到底层的memory pook和高阶抽象的traits机制的实现。(Before the secret source code, you will see the vector implementation, list implement
RedBlackBST
- 红黑树和AVL树一样都对插入时间、删除时间和查找时间提供了最好可能的最坏情况担保。这不只是使它们在时间敏感的应用如实时应用（real time application）中有价值，而且使它们有在提供最坏情况担保的其他数据结构中作为建造板块的价值；例如，在计算几何中使用的很多数据结构都可以基于红黑树。(a red black tree is a self balancing tree that could balance it self)
二叉树
- 基于二叉查找树进行优化，进而可以得到其他的树表查找算法，如平衡树、红黑树等高效算法(Based on the two fork search tree, we can optimize other tree table lookup algorithms, such as balanced tree, red black tree and other efficient algorithms.)