搜索资源列表
ISAM
- 基于B-树的信息存储,支持插入、删除、搜索、对B-树的信息定制等各种操作。-Information restore based on the B-tree.Founctions like insert、delete and search can be supported.
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.
Btree
- 对B树的创建、遍历、查找、删除等作以简单的实现。-The creation of the B tree, traversal, search, delete, etc. for a simple implementation.
QuestionandAnserabotdatastructure
- 关于数据结构中B树的常见问题及回答,归纳的比较全面,适合与相关专业的学生,特别是考生-B on the tree data structure and to answer frequently asked questions, summed up a more comprehensive, suitable and relevant professional students, especially candidates
CB-Tree
- C++数据结构中经典B-树的构造方法,功能包括初始化、插入、删除、在控制台输出等功能。-C++ data structure in the classic B-tree construction methods, features include initialization, insert, delete, in the console output and other functions.
Pratical_Algorithms_for_Programmers
- 本书作者为Andrew.Binstock等。 本书重点关注的是实用,立即可用的代码,并且广泛讨论了可移植性和特定于实现的细节。本书作者介绍了一些用用但很少被讨论的算法,它们可用于语音查找,日期和时间历程,B树和索引文件,数据压缩,任意精度的算术,校验和数据验证,并且全面的介绍了例程,排序算法和数据结构。 本书只要求读者具有C语言的初级知识以及基本代数的相关知识。源代码经过测试符合ANSI标准,可以运行在UNIX下,以及BORLAND,Microsoft和Watcom的编译器上。-Book
BPlusTree
- B+树实现的完全代码。B+树定义文件,本程序实行一个简单的B+树 (1) 一个v阶的B+树由根结点、内部结点和叶子结点组成。 (2) 根结点可以是叶子结点,也可以是有两个或更多子树的内部结点。 (3) 每个内部结点包含v - 2v个键。如果一个内部结点包含k个键,则有且只有k+1个指向子树的指针。 (4) 叶子结点总是在树的同一层上。 (5) 如果叶子结点是主索引,它包含一组按键值排序的记录;如果叶子结点是从索引,它包含一组短记录,每个短记录包含一个键以及指向实际记录的
laoban
- 实现B-树的建立查找关键字 进行关键字的插入删除-To achieve the establishment of B-tree insert keyword search remove keyword
BPtree
- B+树数据结构,给出了b+树中各种常用的函数-B+ tree data structure, b+ tree is given a variety of commonly used functions
B_Tree
- 用C实现的一段B树源码。 是一个简单的示例,主要介绍如何实现B树的建立,插入、查询、删除等功能-Section B with the C implementation source code tree. Is a simple example, describes how to build a tree B, insert, query, delete, etc.
stx-btree-0.8.3
- 用b+树算法实现的map,set容器,查找速度超快-map,set container base on B+tree algorithm 。can search faster than the STL container base on RBtree algorithm
B-tree
- 输入一棵二叉树的扩展的前序序列,经过处理后生成一棵二叉树,然后对于该二叉树输出前序、中序和后序遍历序列。-Enter the extension of a binary tree sequence of the first order, a binary tree generated after treatment, then the binary output for pre-order, the order and post order traversal sequence.
BtreeImpl
- B树算法与实现(C数据结构),十分详细哦-B-tree algorithm and implementation (C data structure), very detailed Oh! ! !
BTree
- 实现了B树的创建,在此基础上,构建搜索信息,完成了搜索,添加,删除,显示树形等操作-Realized B the creation of a tree, based on this information, the construction of the search, completing the search, add, delete, shows such as tree operation
btree
- B树,是一种很有效率二叉搜索树,利用它可以的旋转功能可以很方便的构造,很快的查找 数据结构-B-tree is a very efficient binary search tree, it can use the rotation function can be constructed easily, quickly find the data structure
BTREE2
- B树,包括建立,查找,添加,删除等操作,支持外存索引-B tree,include insert , search, and delete
BTree
- b-树的建立插入删除,基本演示,数据结构课设-b-tree creation insertion deletion, basic presentation, set up data structures course
btree
- 标准C++的B树实现,使用类和模板,具有通用和代表性。-A c++ implementation OF b tree, which is generic and representative.
BplusT
- 实现B+ 树的查找、插入和删除的功能,自动建立B+树,并可以对属性进行索引-Implement the B+ tree search, insert and delete functions, automatically create B+ trees, and can be indexed on the properties
Btree
- B树的C++实现代码,实现了插入,删除,查找的功能,在VS2008和GCC下通过编译。 B树的实现代码在Btree.h里,TestBtree.cpp是一个非常简单的测试-Implementation code of the Btree