Location:
Search - 2-4 Trees
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: 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: huffman完整源代码C语言实现，有本人超级详细解释（看不懂你去跳楼吧）
算法设计:
1、对给定的n个权值{W1,W2,W3,...,Wi,...,Wn}构成n棵二叉树的初始集合F={T1,T2,T3,...,Ti,...,Tn}，其中每棵二叉树Ti中只有一个权值为Wi的根结点，它的左右子树均为空。（为方便在计算机上实现算法，一般还要求以Ti的权值Wi的升序排列。）
2、在F中选取两棵根结点权值最小的树作为新构造的二叉树的左右子树，新二叉树的根结点的权值为其左右子树的根结点的权值之和。
3、从F中删除这两棵树，并把这棵新的二叉树同样以升序排列加入到集合F中。
4、重复二和三两步，直到集合F中只有一棵二叉树为止。
-Huffman complete C source code language, I have super-detailed explanation (you do not understand it jumped) algorithm design : one, the right to the right values n (W1, W2, W3 ,..., Wi ,..., Wn) n trees constitute the binary tree initial pool F = (T1, T2, T3, ... Ti ,..., Tn), which is indeed a binary tree Ti only a right to the value of Wi Root. it's about subtrees are empty. (For the convenience of the computer algorithm, the general also demanded the right to Ti Wi value of ascending.) 2. in 1984 two F Root weights smallest tree as a new structure of the binary tree around subtrees, new Binary Tree Root in the right value for their son around the tree Root and the right value. 3, F deleted from this two trees, and how the new binary tree in the same ascending into the pool F. 4, re
Platform: |
Size: 11264 |
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: 二叉树的建立与遍历
可实现：
（1）树的创建采用先序方式，用特殊符号0表示左、右子树为空
（2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构
（3）节点的值为非零数
（4）可以（）形式输出创建的树
（5）用先序后序和中序遍历树
（6）销毁树
-Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees
Platform: |
Size: 1024 |
Author: 林渡 |
Hits:
Description: 哈夫曼编码与解码演示程序
1、 从初始界面中给出的信息选择相应功能；
2、 从终端读入字符集大小n，以及n个字符和n个权值。建立huffman树，并将它存于文件hfmtree.dat中
3、 利用已经建好的huffman树对文件tobetran.dat中的正文进行编码，然后将结果存入文件codefile.dat中；
4、 利用已经建好的huffman树将文件codefile.dat中的代码进行译码，结果存入文件textfile.dat中；
5、 将文件codefile.dat以紧凑格式显示在终端上，每行50个；
6、 将已在内存中的huffman树以直观的方式显示在终端上；
-Huffman encoding and decoding demo 1, from the initial information given in the interface to select the appropriate function 2, read from the terminal character set size n, and n and n characters of the right values. Huffman tree establishment, and it is stored in documents hfmtree.dat in 3, has been built using huffman trees tobetran.dat the document is encoded in the body, and then the results into a document in codefile.dat 4, has been built using huffman tree will be a good document codefile.dat decoding of the code, the result into the document in textfile.dat 5, in order to compact the file format codefile.dat displayed on the terminal, 50 per line 6, will have huffman tree in memory intuitive way to show that in the terminal
Platform: |
Size: 273408 |
Author: 郑亮 |
Hits:
Description: 二叉树的基本算法。（1） 输出二叉树B；
（2） 输出二叉树B的深度；
（3） 输出H结点的左、右孩子结点值；
（4） 输出二叉树B的宽度；
（5） 输出二叉树B的结点个数；
输出二叉树B的叶子结点个数
-The basic algorithm for binary tree。(1) output binary tree B
(2) The output of a binary tree B of depth
(3) The output of H nodes left and right child node value
(4) outputs a binary tree B, width
(5) output node B, the number of binary trees
Output binary tree B, the number of leaf nodes
Platform: |
Size: 1024 |
Author: xjj |
Hits:
Description: (一) 编写一个程序LAGO7-1.CPP，实现二叉树的各种运算，并在此基础上设计一个主程序完成如下功能。
（1） 输出二叉树B；
（2） 输出二叉树B的深度；
（3） 输出H结点的左、右孩子结点值；
（4） 输出二叉树B的宽度；
（5） 输出二叉树B的结点个数；
输出二叉树B的叶子结点个数
-(A) to prepare a program LAGO7-1.CPP, to achieve a variety of binary operations, and on this basis, design a main program performs the following functions.
(1) output binary tree B
(2) The output of a binary tree B of depth
(3) The output of H nodes left and right child node value
(4) outputs a binary tree B, width
(5) output node B, the number of binary trees
(6) outputs a binary tree B, the number of leaf nodes
Platform: |
Size: 2048 |
Author: xjj |
Hits:
Description: 一款基于Extjs的自定义Tree组件
扩展的功能点有：
一、支持只对树的叶子进行选择
二、支持对树的单选只允许选择一个结点使用时，只需在声明树时二、支持对树的级联多选
内附使用说明-Extjs Based on a custom Tree component expanded function points are: First, to support only the leaves on the trees to choose two, support for the tree to select a radio node is only allowed to use, just when the two trees in a statement , support for cascading multiple choice tree containing instructions
Platform: |
Size: 4096 |
Author: 幻想 |
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: SpeedTree是一个专门的植被引擎。创造出高度逼真的树木和植物，并且可以调整风速效果，使得这些植物随着风的吹动而真实地摇动.本人上传的是4.1版本的SDK，可以嵌入自已的程序中，还包含两篇关于使用和介绍的博文，方便大家学习研究。-SpeedTree is a specialized vegetation engine. To create highly realistic trees and plants, and wind effects can be adjusted, so that these plants with the wind blowing and truly shaken. I uploaded the 4.1 version of the SDK, can embed their own application, also contains two on the use and presentation of the Notes, we facilitate study and research.
Platform: |
Size: 13967360 |
Author: 胡凯 |
Hits:
Description: dtree是一个由JavaScript编写成的简单的树形菜单组件，目前免费并且开源。
dtree
目前有很多的树形菜单组件(比如ext)，dtree是一种简单易懂的js组件，不需要复杂的操作即可生产，同时支持动态从数据库引入数据。
dTree可以不用添加任何页面而直接用代码实现多个栏目，并可以实现无限分级，下面是官方介绍的优点：
- Unlimited number of levels(无限分级)
- Can be used with or without frames(可用于框架或非框架页面)
- Remembers the state of the tree between pages(在不同页面之间可记住当前状态)
- Possible to have as many trees as you like on a page(可以得到你想要数量的树型)
- All major browsers suported(支持的浏览器)
Internet Explorer 5+ Netscape 6+ Opera 7+ Mozilla
- Generates XHTML 1.0 strict validated output(严格支持XHTML 1.0)
- Alternative images for each node(每个节点用图片代替)
-dtree is written into a simple JavaScript tree menu component, the current free and open source.
dtree
There are a lot of tree menu components (such as ext), dtree is a straightforward js components without complex operation can produce, while supporting the introduction of dynamic data from the database.
dTree can not add any page number directly with the code section, and can achieve unlimited classification, the following is the official description of the benefits:
- Unlimited number of levels
- Can be used with or without frames
- Remembers the state of the tree between pages
- Possible to have as many trees as you like on a page
- All major browsers suported Internet Explorer 5 Netscape 6 Opera 7 Mozilla
- Generates XHTML 1.0 strict validated output
- Alternative images for each node
Platform: |
Size: 26624 |
Author: 何启明 |
Hits:
Description: 二叉树也是递归定义的，其结点有左右子树之分，逻辑上二叉树有五种基本形态： (1)空二叉树——(a)； (2)只有一个根结点的二叉树——(b)； (3)右子树为空的二叉树——(c)； (4)左子树为空的二叉树——(d)； (5)完全二叉树——(e)注意：尽管二叉树与树有许多相似之处，但二叉树不是树的特殊情形。
-Binary tree is recursively defined, and its sub-tree nodes are so divided, there are five basic logical form of binary tree: (1) empty binary tree- (a) (2) there is only one root node Binary Tree- (b) (3) the right subtree of the binary tree is empty- (c) (4) the left subtree of the binary tree is empty- (d) (5) completely Binary Tree- (e) Note: Although the binary tree and the tree has many similarities, but the binary tree is not a special case.
Platform: |
Size: 1024 |
Author: zn |
Hits:
Description: （1）按逆波兰表达式建立树
(2) 输出表达式树的各种遍历的结果。
(3) 打印表达式树。
(4) 删除表达式树。
-(1) The establishment of trees by Reverse Polish Notation (2) output a variety of expression tree traversal results. (3) Print the expression tree. (4) Delete an expression tree.
Platform: |
Size: 1024 |
Author: 李联合 |
Hits:
Description: c++，入门代码大全。适合入门与初学者，以及有一定基础的人下载- Chapter 1 Introduction 1 Chapter 2 Algorithm Analysis 5 Chapter 3 Lists, Stacks, and Queues 9 Chapter 4 Trees 29 Chapter 5 Hashing 41 Chapter 6 Priority Queues (Heaps) 45 Chapter 7 Sorting 53 Chapter 8 The Disjoint Set 59 Chapter 9 Graph Algorithms 63 Chapter 10 Algorithm Design Techniques 77 Chapter 11 A
Platform: |
Size: 463872 |
Author: 信息管理 |
Hits:
Description: 此示例演示如何训练随机树分类，运行环境VC++2010, 基于Opencv2.4.2。-The sample demonstrates how to train Random Trees classifier
Platform: |
Size: 5120 |
Author: 永 |
Hits:
Description: 嘎斯TreeStore和树型视图是两类,可用于实现MVC列表树只需几行Javascript代码。虽然没有太多的文档目前的例子是相当不言自明。
-Gaz TreeStore and TreeView are two classes that can be used to implement MVC tabular trees in just a couple of lines of Javascript code. While there isn t much documentation right now the example is quite self-explanatory.
Platform: |
Size: 59392 |
Author: fsdafgiko |
Hits:
Description: create a new Boolean object whose default value is the value of the boolean.
Platform: |
Size: 2048 |
Author: doutancui |
Hits:
Description: 图书管理基本业务活动包括：对一本书的采编入库、清除库存、借阅和归还等等。试设 计一个图书管理系统，将上述业务活动借助于计算机系统完成。 要求： （1）每种书的登记内容至少包括书号、书名、著者、现存量和总库存量等五项。
（2）作为演示系统，不必使用文件，全部数据可以都在内存存放。要用 B-树（4 阶树） 对书号建立索引，以获得高效率。 （3）系统应有以下功能： 采编入库、清除库存、借阅、归还、显示（以凹入表的形式显示）等。-Library management basic business activities include: editing of a book storage, remove stock, borrow and return and so on. Try to design a library management system, the operations described above by means of a computer system to complete. Requirements: register content (1) of each book includes at least ISBN, title, author, and total inventory of existing other five.
(2) as a demonstration system, do not use a file, all the data can all be stored in memory. Use the B- tree (4 TREES) ISBN indexed to obtain high efficiency. (3) The system should have the following features: editing storage, clearing inventory, borrow, return, display (in the form of a concave of the table) and the like.
Platform: |
Size: 3072 |
Author: 杨若兮 |
Hits:
Description: 图书管理基本业务活动包括：一本书的采编入库，清除库存，借阅和归还等。采用B-树（4阶树）对书号建立索引，以获得高效率。-Library Management basic business activities include: editing a book storage, inventory clearing, borrow and restitution. Using B- tree (4 TREES) ISBN indexed to obtain high efficiency.
Platform: |
Size: 5120 |
Author: OnAir |
Hits: