网站首页

b-trees

于 2021-01-20 发布文件大小:32KB

 0  190

下载积分: 1 下载次数: 2

我要下载

代码说明：

① 实现在B-树上的查找，并分析其时间复杂性。 ② 实现B-树的ADT，包括其上的基本操作：结点的加入和删除。 ③ 要求B-树结构中的M=3 或5，实现其中的一种即可。 ④ 实现基本操作的演示。 (4) 实现提示 (b-trees c/c++)

文件列表：

b%2B;b-树
.......\b%2B.cpp,22739,2012-01-03
.......\b%2B.dsp,3355,2012-01-03
.......\b%2B.dsw,512,2012-01-03
.......\b%2B.ncb,50176,2012-01-03
.......\b%2B.opt,48640,2012-01-03
.......\b%2B.plg,3454,2012-01-03
.......\b-.txt,17885,2010-05-18
.......\Debug
.......\.....\b%2B.pch,186900,2012-01-03
.......\.....\vc60.idb,33792,2012-01-03
.......\.....\vc60.pdb,36864,2012-01-03

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

LinkedStack
链栈对于堆栈stack的链式实现应用指针(linked stack)

2012-10-03 17:29:55下载

积分：1
Graph
数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)

2013-11-28 10:53:29下载

积分：1
在COM中使用数组_code
COM中使用SAFEARRAY数组例程，代码中给了两种数组的用法，一种是字符串数组，另一种是自定义数据结构数组。 (use COM SAFEARRAY array routines, a code for the use of two arrays, a string array, and the other is from the definition of array data structure.)

2005-07-12 17:00:30下载

积分：1
BSM
一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)

2008-05-04 13:42:30下载

积分：1
2.2
已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)

2015-04-11 23:11:41下载

积分：1
001
二叉树的中序遍历，先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)

2012-06-03 23:26:44下载

积分：1
heapsort
说明：从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)

2008-11-11 22:53:42下载

积分：1
Huffman-Tree
使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。具体的要求： 1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码； 2．将给定编码文件译码，生成字符，输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)

2015-05-22 15:37:03下载

积分：1
BiTree
二叉排序树的建立、插入与删除。按递增顺序插入N个整数，并按同样顺序删除；(Binary sort tree establishment, insertions and deletions. Insert N integers in ascending order, press the same sequence deleted )

2020-09-05 16:38:05下载

积分：1
C-integer-linear-sequence
对元素类型为整型的顺序存储的线性表进行插入、删除和查找操作(C++)。(C integer linear sequence of stored data table insert, delete and search operations)

2011-11-20 11:13:40下载

积分：1

696518资源总数
105549会员总数
12今日下载

b-trees

0 个回复

热门标签

热门下载