Search - 2-3 tree

Search - 2-3 tree - List

[Windows Develop] 普里姆算法构造最小生成树3 DL : 0: 普里姆算法构造最小生成树-Primbetov tectonic minimum spanning tree algorithm
Date : 2026-01-03 Size : 1kb User : 涛涛
[Windows Develop] jasmine4 DL : 0: 编写一个程序实现顺序栈的各种基本运算,并在此基础上设计一个主程序完成如下功能： 1．初始化栈S。 2．判断栈S是否为空。 3．依次进栈元素a,b,c,d,e。 4．判断栈S是否为空。 5．输出栈长度。 6．输出从栈顶到栈底的元素。 7．输出出栈序列。 8．判断栈S是否为空。 9．释放栈。-Realize the order of the preparation of a program stack of basic computing, and on this basis the design of a main program to complete the following functions: 1. Initialize stack S. 2. To determine whether the stack S is empty. 3. Elements into the stack followed by a, b, c, d, e. 4. To determine whether the stack S is empty. 5. The length of the output stack. 6. Output from the Top-stack at the end of the element. 7. Output sequence of the stack. 8. To determine whether the stack S is empty. 9. Release stack.
Date : 2026-01-03 Size : 4kb User : jiangyumin
[Windows Develop] FastFourierTransform DL : 0: This function is written to understand and/or explain an fft algorithm and usage of radix2 procedure. This function take the signal which you want to find FFT, for m bit you can also call the function without entering a signal or number of points, because there is default values for y and m which are y = sin(2*pi*50*t)+sin(2*pi*120*t) m=3 you can see the steps of order reversing used as built-in function but non others. you will also see the taking butterfly tree steps. for more information read the help file of function. in future this can be improve as selective radix or any other feature you suggest please notice me for any sugestion.
Date : 2026-01-03 Size : 3kb User : dairy
[Windows Develop] btree DL : 0: 首先，要知道B tree的主要元素是所謂的資料節點(node) ，每個資料節點內含有一些資料，以及指向其他資料節點的指標(pointer)。資料節點之間以枝幹相連，尾端就是枝葉(leaf) ，假設開始插入的資料順序為 : 1，2，3，4，5，6。以下就依照B tree的規則來種樹。-First of all, we know the main elements of B tree is the so-called information node (node), each data node contains some information, as well as other data point to the node indicator (pointer). Information between the nodes connected to the branches, that is the end of branches and leaves (leaf), the assumption that the information began to insert the following order: 1,2,3,4,5,6. On the B tree in accordance with the following rules to plant trees.
Date : 2026-01-03 Size : 23kb User : qq
[Windows Develop] Huffmanencoderdecoder DL : 0: 在发送端通过一个编码系统对待传输数据编码. 在接收端将传来的数据进行译码. 一个完整的系统应具有以下功能: (1)初始化.从终端读入字符集大小,以及字符和权值,建立哈夫曼树,并保存. (2)编码.利用以建好的哈夫曼树对正文进行编码,然后保存. (3)译码.利用已建好的哈夫曼树将文件中的代码进行译码,结果打印出来. -At the sending end through a coding system for encoding transmit data treatment. Will be heard in the receiver to decode the data. A complete system should have the following functions: (1) initialization. Read from the terminal character set size, as well as the characters and the right values, the establishment of Huffman trees, and save. (2) coding. used to build the Huffman tree to encode the text and then save it. (3) decoding. the use of the Huffman tree has been built will document the code decoding, the results print out.
Date : 2026-01-03 Size : 3kb User : 晶
[Windows Develop] JJ DL : 0: One names depth of a tree the maximum number of "descents" which can be carried out starting from the root. For example, the third binary tree of figure 1 has a depth of 3.According to this reasoning, a tree having one or no node is of depth 0.
Date : 2026-01-03 Size : 2kb User : koukouafiri22
[Windows Develop] treedatawindow DL : 0: 树型datawindow，加上了3态的checkbox,很经典-Tree datawindow, with a 3-state checkbox, classic ... ...
Date : 2026-01-03 Size : 58kb User : Thomas.Chen
[Windows Develop] stx-wxbtreedemo-0.8.3-win32 DL : 0: w32 tree graphical demo
Date : 2026-01-03 Size : 726kb User : beastie
[Windows Develop] 234tree DL : 0: 2-3-4Trees and Red-Black Trees 2-3-4Trees and Red-Black Trees-2-3-4Trees and Red-Black Trees 2-3-4Trees and Red-Black Trees 2-3-4Trees and Red-Black Trees
Date : 2026-01-03 Size : 119kb User : Ardy
[Windows Develop] sjjg3 DL : 0: B_tree的插入与删除 B树的表示及基本操作的实现。 1．掌握B树的存贮结构。 2．实现B树中关键字值的插入及删除操作。 3．练习屏幕图形化的显示。 -B_tree insertion and deletion B tree representation and the realization of basic operations. 1. Master B tree storage structure. 2. Keyword values to achieve B tree insertion and deletion operations. 3. Exercise-screen graphical display.
Date : 2026-01-03 Size : 3kb User : 赵欣婷
[Windows Develop] createpc DL : 0: 用于进程创建模拟实现，进程的树形结构采用广义二叉树的方式进行存储。可以输入createpc 命令创建进程，输入showdetail 显示每个进程及其子进程的信息，测试命令解释如下： 1) createpc 创建进程命令。参数： 1 pid（进程id）、 2 ppid（父进程id）、3 prio（优先级）。示例： createpc(2,1,2) 。创建一个进程，其进程号为2，父进程号为1，优先级为2。 2) showdetail 显示进程信息命令。 3) exit 退出命令行。-Used to create a simulation of the process to achieve, the process of tree-structured approach to the generalized binary tree is stored. Enter createpc command to create the process, enter showdetail displayed for each process and its child process the information, test commands are explained as follows: 1) createpc command to create the process. Parameters: 1 pid (process id), 2 ppid (parent process id), 3 prio (priority). Example: createpc (2,1,2). Create a process, its process number is 2, the parent process ID is 1, the priority level of 2. 2) showdetail Display process information using the command. 3) exit out of the command line.
Date : 2026-01-03 Size : 2kb User : height
[Windows Develop] 2 DL : 0: 根据二叉树的抽象数据类型的定义，使用二叉链表实现一个二叉树。二叉树的基本功能： 1、二叉树的建立 2、前序遍历二叉树 3、中序遍历二叉树 4、后序遍历二叉树 5、按层序遍历二叉树 6、求二叉树的深度 7、求指定结点到根的路径 8、二叉树的销毁 9、其他：自定义操作-According to a binary tree definition of abstract data types, use two forks to achieve a binary tree list. The basic functions of a binary tree: 1, the establishment of two binary tree, preorder traversal binary tree 3, 4 in order binary tree traversal, postorder binary tree 5, according to a binary tree traversal sequence 6, seeking binary tree of depth 7, find the specified node to the root of the path 8, the destruction of binary 9, Other: Custom Actions
Date : 2026-01-03 Size : 920kb User : 殷琪
[Windows Develop] exercise DL : 0: （实习题）从键盘上输入一串正整数，最后输入－1作为输入结束的标志。如输入的序列为：2，5，7，23，48，96，……，-1。请以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树。注意：请采用动态存储方法保存这棵二叉排序树，事先并未知道该二叉排序树中的结点的个数。 2、（作业题）已知一棵排序二叉树，树中结点的形式为： data info left right 其中，data 给出结点的数据场，info 给出本结点的左子树中的结点总数，left和 right 分别给出本结点的左儿子和右儿子的地址。数据场data 和info的类型皆为 int。又已知该二叉排序树的根结点的地址为 root。请设计二个函数，分别实现下述功能： 1．按递增序找出该二叉排序树中的第 i 个小的结点。 2．插入数据场之值为 x 的结点，并仍应保持该二叉排序树的性质不变。 3、（作业题）已知一棵二叉排序树，其根结点的地址为 root。请编写一个程序，构造出一棵具有相同结点的完全二叉树，且它同样是二叉排序树。 6/39 4、（选作题）在平衡的排序二叉树的中，试编写删除具有给定关键字的结点的函数。 -(Attachment title) from the keyboard to enter a positive integer, the last input-1 as the input end of the sign. If the input sequence: 2,5,7,23,48,96, ... ...,-1. Please these are integer values as binary sort tree nodes of the value data field, the establishment of a binary sort tree. NOTE: Please save the tree with dynamic storage is binary sort tree, did not know in advance of the binary sort tree, the number of nodes. 2, (working title) is known a sort tree, the tree nodes in the form of: data info left right One, data node given the data field, info is given the left sub-tree nodes in the total number of nodes, left and right nodes are given the left and right son of the son s address. Data field data and the type of info are all int. It is known that the binary sort tree root node s address root. Please design two functions, namely to achieve the following functions: 1. By increasing order to find the binary sort tree nodes i-small. 2. Insert data field of the
Date : 2026-01-03 Size : 755kb User : Lynn
[Windows Develop] 2cha DL : 0: 1 顺序表转成链表建立二叉树 2 交换左右孩子 3 判断完全二叉树-A sequence of Table 2 converted into a binary tree list to establish the exchange of judgments about a child three full binary tree
Date : 2026-01-03 Size : 3.32mb User : 许振海
[Windows Develop] DataStructureReport DL : 0: 3个实验报告分别是客户消费积分管理系统，校园导航问题，判别否为二叉排序树。大二数据实验报告 -3 lab reports Are the integral management of Consumer, campus navigation issues, determine whether the binary sort tree. Sophomore laboratory report data
Date : 2026-01-03 Size : 102kb User : 曹操
[Windows Develop] Dome DL : 0: 1.采用链式结构实现任意多项式的存储，求两个多项式的和。 2.假设自上而下按层次，自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素，P为其父结点，L指示D为P 的左孩子，R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。 3.采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。-1 using an arbitrary polynomial chain structure of storage, and the sum of two polynomials. 2 Assuming a hierarchical top-down, from left to right input of each node a triple (D, P, L/R). Where D is an element node, P is the parent node, L indicates D is the left child of P, R indicates D is P' s right child. Try to write a binary tree in memory to establish a double-stranded representation algorithm and achieve first root, the root, root, and layer after traversal algorithms. 3 using adjacency matrix used to achieve network storage, to establish a network and to achieve single-source shortest path algorithm.
Date : 2026-01-03 Size : 7kb User : 白杨
[Windows Develop] Huffman DL : 0: 用mfc完成的哈夫曼树的功能给出一组关键字，建立哈夫曼树，完成以下功能：（1）完成关键字来自于输入（2）完成关键字来自于文本（3）完成编码，显示编码结果（4）画树-Completed using mfc Huffman tree function gives a set of keywords, the establishment of the Huffman tree, complete the following functions: (a) completion of keywords from the input (2) completion of keywords from the text (3) complete coding display coding results (4) painting trees
Date : 2026-01-03 Size : 8kb User : 黄愫芸
[Windows Develop] BinaryTree DL : 0: 1. 建立二叉树 2. 计算结点所在的层次 3.统计结点数量和叶结点数量 4.计算二叉树的高度 5.计算结点的度 6.找结点的双亲和子女 7.二叉树的遍历 8.二叉树的输出-1. Establish binary 2. Calculate the junction point where the level 3 number of nodes and the number of statistics leaf node 4. Calculate the height of a binary tree 5. Calculation node 6. Looking for parents and children of the node traversal 7. Binary Tree 8 binary outputs
Date : 2026-01-03 Size : 3kb User : 尚亚涛
[Windows Develop] shudong-share-2.3 DL : 0: 树洞外链是一款免费的外链程序，程序使用七牛作为储存空间，提供匿名便捷的文件外链、网盘服务-Outside the cave chain tree is a free outside the chain of procedures, procedures for the use of seven cattle as storage space and provide anonymous convenient file outside the chain, SkyDrive service
Date : 2026-01-03 Size : 1.88mb User : zhong8
[Windows Develop] 精易编程助手 DL : 0: 窗口探测 1.改善显示窗口树的刷新速度、探测时定位速度和查找速度。 2.改善优化易代码生成，增加快捷键，并记忆最后一次使用的生成方式。 3.修复生成易代码后，马上关闭会出错的问题，感谢易友【MaoLin】提醒网页分析 1.修复采集网页资源，背景文件路径部分有误的BUG 2.修复网页分析，分析图片无法预览的问题屏幕取色 1.修复最小化后，右侧取色小窗口空白的问题。 2.增加取色后针对于屏幕和窗口的坐标，感谢易友【齐恩】建议(Window detection 1. to improve the refresh speed of the display window tree, the speed of detection and the speed of searching. 2. improve the optimization of easy code generation, increase shortcut keys, and remember the last use of the generation method. 3. repair generate easy code, immediately shut down the problem will be wrong, thank you easy friend [MaoLin] reminder Web page analysis 1., repair the collection of web resources, background file path part of the wrong BUG 2. web page analysis, analysis of pictures can not preview the problem Screen color 1. repair after minimizing the right color small window blank problems. 2. color coordinates for the screen and window after the needle, thanks to easy friends [Czin] suggestions)
Date : 2026-01-03 Size : 1.99mb User : 742347999

« 12 3 »