Location:
Search - 2-3-4 tree
Search list
Description: 数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Platform: |
Size: 4096 |
Author: 洪玲叶 |
Hits:
Description: ADT BinaryTree 的实现及验证程序采用的主要数据结构：二叉树、栈、队算法思想：1、 先序建树、输出树、后序遍历用递归方法。性能分析：O( n )2、 先序遍历、中序遍历：性能分析：O( n )(1) 若遇到新节点非空则先入栈，然后访问其左子树。(2) 若为空则将栈顶结点出栈，访问其右子树。(3) 循环1、2直到栈为空且无节点可入栈。先序与中序的区别是：先序在入栈时访问节点，中序在出栈时访问节点。3、 层遍历：性能分析：O( n )(1) 根节点入队(2) 节点出队并访问(3) 若节点有左孩子，则左孩子入队；有右孩子，则右孩子入队。(4) 重复2、3直到队列为空。4、 线索树：算法与先序遍历、中序遍历一样，只是将访问节点的Visit函数改为连接前驱与后继的操作。性能分析：O( -BinaryTree ADT Implementation and certification procedures used in the main data structure : binary tree, stack, algorithms team thinking : a first order contribution, the output tree, after preorder using recursive method. Performance Analysis : O (n) 2, preorder, the preorder : Performance Analysis : O (n) (1) If there is a new non-empty nodes were first pushed and then left to visit their son tree. (2) if the empty Zhanding node will stack up, visit their right subtrees. (3) 1,2 cycle until the stack is empty with no node can be pushed. First sequence with the sequence difference : Push the first sequence to visit nodes, which stack up in order to visit nodes. 3, the layer traverse : Performance Analysis : O (n) (1) nodes into Force (2) nodes and the team's visit (3) if the nodes ar
Platform: |
Size: 2048 |
Author: 徐欣 |
Hits:
Description: 清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;
Platform: |
Size: 3072 |
Author: qqiang |
Hits:
Description: 1．n个叶结点,权分别为w1,w2,• • • ,wn的二叉树中，带权路径长度WPL最小的二叉树叫最优二叉树， 也叫霍夫曼树。
2．霍夫曼算法：1）根据给定的权值{w1,w2,• • • ,wn}构造n个二叉树F={T1,T2,• • • ,Tn}每个Ti只有一个根结点，权为wi。2）在F中选取两棵根结点的权值最小的树 构成一棵新的二叉树，其根的权值为左右子树根的权值的和。3）F中删去这两棵树，加上新得的树。4）重复2）3）直到只剩一棵树。
-1. N leaf nodes, the right to w1, w2,# 8226# 8226, wn the binary tree, with the right path length WPL smallest binary tree called Optimal binary tree, the tree is also called Hoffman. 2. Hoffman algorithm : 1) According to the weights (w1, w2,# 8226# 8226# 8226, wn) n binary tree structure F = (T1, T2,# 8226# 8226# 8226, Tn) each only a Ti Root, the right to wi. 2) In 1984 two F Root in the value of the right to the smallest tree constitute a new binary tree, the roots of the right value for the son around the roots and the value of the right. 3) F deleted these two trees, coupled with the new tree. 4) repeat 2) 3) until only a tree.
Platform: |
Size: 1024 |
Author: yy |
Hits:
Description: 1． 汽车轮渡口，过江渡船每次能载10辆车过江，过江车辆分为客车类和货车类，上渡船有如下规定：同类车先到先上船，客车先于货车上渡船，且每上4辆客车，才允许上一辆货车。若等待客车不足4辆，则从货车代替，若无货车等待允许客车上船。试写一个算法模拟渡口管理。
算法设计:
1客车和货车均建立一个链式队列，初始均为空。以后来一辆车不是货车就是客车，因此可以说整个程序的事件驱动event就是这两个,客车表示1，货车表示0.
2轮船还没有到达时客车和货车均按次序排在各自队列中。
3轮船到达时，根据两个队列的情况，分别处理。处理如下：
a 客车数不满4辆，则将排在前面的货车上船，但总数不能超过10，若没有货车等待，客车直接上船。
b 客车数满4，但不满8辆，客车先上，排在前面的只有一辆货车可以上船，若没有货车等待则货车不上。
c 客车满8辆但不满10，客车上船，排在前面的货车最多可以上2辆，但总数不能超过10。
d 客车满10，则全上客车,但总数不能超过10。
-1. I car ferry, crossing the river each ferry can carry 10 cars crossing the river, crossing the river into passenger vehicles and goods category, Ferry on the following provisions : first vehicle in a first embarkation, the first passenger ferry in the truck and four on each passenger will be permitted on a lorry. If waiting for the bus less than four, then replace the truck, without waiting for the lorry to allow passenger embarkation. Try to write a simulated crossing management. Algorithm design : a bus and the truck were established a chain cohort, the initial were empty. Later, a car is not a passenger vehicle is, it can be said of the entire process event-driven event is the two, said a passenger, said the lorry 0. Two ships have not yet arrived at the bus and the truck were ranked
Platform: |
Size: 2048 |
Author: 西们子 |
Hits:
Description: 叉排序树与平衡二叉排序树基本操作的实现
用二叉链表作存储结构
(1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T；
(2)对二叉排序树T作中序遍历,输出结果；
(3)计算二叉排序树T的平均查找长度,输出结果；
(4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结
点,并作中序遍历(执行操作2)；否则输出信息“无结点x”；
(5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!"/"NO!" ;
Platform: |
Size: 2048 |
Author: 胡图 |
Hits:
Description: extjs基于JS开发的一个客户端程序，有很漂亮的界面和功能，希望大家喜欢-extjs developed a JS-based client program, there are very beautiful interface and features, I hope you like
Platform: |
Size: 4680704 |
Author: colby |
Hits:
Description: 该软件可以方便的把HTML网页解析成一棵Tree，方便的获得各个节点的名称和属性，一款很好的解析HTML的软件。-The software can easily turn into an HTML page analysis Tree, convenient access to each node name and attributes of a good HTML analytic software.
Platform: |
Size: 123904 |
Author: 李铭岳 |
Hits:
Description: binary_tree_level_order(二叉树层排序):
输入:数组{1,2,3,4,5,6,7,8,9,10},建立二叉树,再进行层排序.
输出:输出排序结果.-binary_tree_level_order (tree layer order): Input: array (1,2,3,4,5,6,7,8,9,10), the establishment of binary tree and then sort layer. Output: Output to sort the results.
Platform: |
Size: 1024 |
Author: 陈扬坤 |
Hits:
Description: b-树的增加,因为我看到的资料里的最大关键字数目为m-1,我考虑了一下,2-3树的删除会比较麻烦,后来看了下算法导论,别人的数目是2t-1,所以相同情况下是2-3-4树,我考虑按照这个因子再写一个,增加删除部分,有问题可以联系我,联系方式在程序中已注明.-b-tree increases, because the information I have seen in the largest number of keywords for the m-1, I consider a bit ,2-3 tree removal would be more trouble, after reading An Introduction to the next algorithm, the number of people are 2t-1, so the same circumstances are 2-3-4 tree, I consider this factor in accordance with the write one, delete some of the increase, has problem can contact me, Contact us in the proceedings have been marked.
Platform: |
Size: 2048 |
Author: 杨毅 |
Hits:
Description: 求一棵加分值最高的二叉树，其中序遍历序列为给出的节点编号顺序，如1，2，3，4，5...n，求出的树加分值最高-The highest score for an increase in the binary tree, which traversal sequence for the given node number sequence, such as 1,2,3,4,5 ... n, obtained the highest score of the tree increases
Platform: |
Size: 4096 |
Author: yyx |
Hits:
Description: ajax tree
需要prototype-1.6.0.3.js-ajax tree
need prototype-1.6.0.3.js
Platform: |
Size: 5120 |
Author: nick pan |
Hits:
Description: 二叉排序树的创建与使用
(时间限制为：1000毫秒)
描述：
二叉排序树的定义是：或者是一棵空树，或者是具有下列性质的二叉树：（1）若它的左子树不空，则左子树上所有的结点值均小于它的根结点的值；（2）若它的右子树不空，则右子树上所有结点的值均大于或等于它的根结点的值；（3）它的左右子树也分别为二叉排序树。现要求根据输入的元素值，构造一棵二叉排序树，并输出其先序遍历、中序遍历和后序遍历结果。
输入：
输入第一行为测试用例个数n，接下来为n个测试用例，每个测试用例占两行，其中第一行为元素个数m，第二行为m个需要构造成二叉排序树的元素值。
输出：
每个测试用例用三行输出，其中第一行输出先序遍历结果，第二行输出中序遍历结果，第三行输出后序遍历结果。各元素之间用一个空格隔开。
样例输入：
1
5
8 4 2 6 4
样例输出：
8 4 2 6 4
2 4 4 6 8
2 4 6 4 8
-Binary Sort Tree creation and use of
(Time limit: 1000 ms)
Description:
Binary sort tree is defined as: either an empty tree, or the nature of the binary tree with the following: (1) if its left subtree is not empty, then the left sub-tree of all nodes were less than the value of its root node (2) if it s the right subtree is not empty, then the right sub-tree of all nodes are greater than or equal to the value of its root node (3) around its sub- tree were binary sort tree. Are required elements of the input value, a binary sort tree structure, and the output of its first order traversal, inorder traversal and postorder traversal results.
Input:
Enter the number of the first acts of the test case n, then for the n test cases, accounting for two lines of each test case, where the first acts of the number of elements m, m a need to construct the second act into a binary sort tree of element values .
Output:
With three lines of output for each test case, wh
Platform: |
Size: 1024 |
Author: zhoupenghua |
Hits:
Description: Example
编译：mpicc mst.c mst
运行：本实例中使用了5个处理器。
mpirun –np 5 mst
运行结果：
Input the size of matrix:9
0 4 5 8 6 2 5 7 3
5 0 8 3 1 6 4 9 5
7 2 0 6 4 1 3 8 9
4 5 6 0 5 7 2 1 6
4 5 8 7 0 2 3 4 7
4 1 4 7 5 0 7 8 4
7 8 9 3 2 1 0 6 7
4 2 1 4 3 5 8 0 9
5 3 2 8 9 7 6 2 0
最终输出结果：
the MST is:
0 0 0 0 0 2 0 0 0
0 0 0 0 1 1 0 0 0
0 0 0 0 0 1 0 1 2
0 0 0 0 0 0 0 1 0
0 1 0 0 0 2 0 0 0
2 1 1 0 2 0 1 0 0
0 0 0 0 0 1 0 0 0
0 0 1 1 0 0 0 0 0
0 0 2 0 0 0 0 0 0
说明：输出结果为最小生成树的边。
-
Example
Compile: mpicc mst.c mst
Run: The example of the use of the five processors.
mpirun-np 5 mst
Run Results:
Input the size of matrix: 9
045,862,573
508,316,495
720,641,389
456,057,216
458,702,347
414,750,784
789,321,067
421,435,809
532,897,620
The final output:
the MST is:
000,002,000
000,011,000
000,001,012
000,000,010
010,002,000
211,020,100
000,001,000
001,100,000
002 million
Description: The output for the minimum spanning tree edges.
Platform: |
Size: 2048 |
Author: aaa |
Hits:
Description: 打造基于jQuery的高性能TreeView
根据我的项目实践情况，主要是几个关键点：
1：支持静态的树，即一次性将全部数据加载到客户端。*
2：异步树，即一次只加载一级或若干级节点，子节点可以异步加载数据。
3：Checkbox树（可能是静态树也可能是异步树），用于选择（如选择组织机构，选择数据字典项）等，最好是能够支持节点级联（这个是难点）
4：能够承载大数据量，并性能表现优异
5：能够在主流浏览器中运行良好
-TreeView jQuery-based, high-performance build my project based on practical circumstances, mainly a few key points: 1: Support for static trees that once all the data will be loaded to the client.* 2: Asynchronous tree, that is, only load one or more of the first level nodes, child nodes can load data asynchronously. 3: Checkbox tree (the tree may also be asynchronous static tree), used to select (such as the choice organization, select the data dictionary entry), etc., it is better to support node cascade (this is difficult) 4: capable of carrying large the amount of data, and good performance in 5: the ability to run the browser in the mainstream good
Platform: |
Size: 71680 |
Author: sunhb1990 |
Hits:
Description: 无限级可刷新Js树型菜单，11个Javascript树形菜单
树形菜单能很好的呈现菜单项之前的从属关系，结构清晰明了。本文为你收集了11个javascript树形菜单。
1. dhtmlxTree
dhtmlxTree是一个功能丰富的Tree Menu控件。提供丰富的操作API，ajax支持和drag-n-drop功能。
2. Control.Treeview
采用Mootools开发的树形菜单控件。支持通过Ajax动态获取节点，设置默认选中某些节点。
3. Folder Tree (演示地址)
文件夹树形控件。支持利用拖放（drag and drop）操作来重新排序节点，利用Ajax更新节点。
4. DHTML Tree
这是一个基于标准Html结构构造的Tree控件。
5. dFTree (演示地址)
dFTree是一个javascript CSS Folder Tree支持利用Ajax技术动态新增/删除/修改节点等功能。-tree note
Platform: |
Size: 26624 |
Author: 叶祥英 |
Hits:
Description: jquery菜单树。非常详细的无限极菜单。基础学院学习的好帮手。-Jquery menu tree. Very detailed unlimited menu. Based school good helper.
Platform: |
Size: 41984 |
Author: 王飞亮 |
Hits:
Description: 对四则运算表达式的抽象语法树进行后序遍历，可以得到输入表达式所对应的四元式序列（实验4要用到这样的四元式序列）。例如输入1+2*(3+4)，对应的抽象语法树的中序遍历序列、四元式序列分别为-After the abstract syntax tree arithmetic expressions were preorder, you can get input expression quaternion corresponding sequence (Experiment 4 to use this quaternion sequence). For example, enter 1+2* (3+4), the traversal sequence corresponding abstract syntax tree quaternion sequences were
Platform: |
Size: 1024 |
Author: 汪祥 |
Hits:
Description: 此处可输入以下树来进行调试。
构建的树为
1
/ | 2 3 4
/ | \ 5 6 7 B
| / 8 9 A
前序遍历:1 2 5 6 8 7 9 A 3 4 B
后序遍历:5 8 6 9 A 7 2 3 B 4 1
层次遍历:1 2 3 4 5 6 7 B 8 9 A-Here you can enter the following tree for debugging. Construction of the tree 1/| \ 2 3 4/| \ \ 5 6 7 B |/\ before 8 9 A preorder: 1256879 A 3 4 B after preorder: 5 8 6 9 A 7 2 3 B 4 1 level traversal: 1 2 3 4 5 6 7 B 8 9 A
Platform: |
Size: 216064 |
Author: 杨丫 |
Hits:
Description: 1.创建一个二叉树
2.可以生成先序遍历二叉树
3.可以生成中序遍历二叉树
4.可以生成后序遍历二叉树
5.计算二叉树的结点总数和叶点数
6.可以建立无向图的邻接矩阵
7.可以生成深度优先遍历图-1. Create a binary tree
2. The first sequence can be generated traversing binary tree
3. Can be generated in order traversing binary tree
4. Can be generated after traversing binary tree
5. Calculation of binary tree nodes and leaves the total points
6. Can create undirected graph adjacency matrix
7. Depth-first traversal graph can be generated
Platform: |
Size: 2048 |
Author: 郭翔 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
25
»