Search - Binary Tree

Search - Binary Tree - List

[Other] 赫夫曼树和编码 DL : 0: 最优二叉树及编码，能够实现给出一组频率构造最优二叉树且求出其编码，在通讯中具有很好的作用。-optimal binary tree and coding, to achieve a given frequency Construction Group optimal binary tree can get its coding, the newsletter has a very good role.
Date : 2008-10-13 Size : 1.34kb User : 廖高
[Other] 四分树的穷举 DL : 0: 使用VC为编程语言，结合数据结构二叉树的概念，新编算法进行四分树的穷举。-VC to use programming language, combine the binary tree data structure concept, a new edition of the tree algorithm quarter of exhaustive.
Date : 2008-10-13 Size : 4.8kb User : 苏晓
[Other] zhou_tree DL : 0: 汇编程序，输入一组数字，生成二叉树，再进行前序，中序，后序三种遍历。含错误检测。-assembler, the importation of a group of figures, generating a binary tree, and before ordering, which sequence, after three traversal sequence. With error detection.
Date : 2008-10-13 Size : 6.11kb User : 周伟斌
[Other] 200561674082801 DL : 0: 我最近的作业，是二叉树的基本操作，新手，各位多多关照。-my recent operations, a binary tree is the basic operation, and newcomers, to take care of you.
Date : 2008-10-13 Size : 2.5kb User : chuanxin
[Other] 求二叉树的高度、叶子节点数 DL : 0: 求二叉树的高度和深度，求高度时采用递归算法，求深度时采用非递归算法。-for binary tree height and depth, used for highly recursive algorithm, seeking depth of the use of non - recursive algorithm.
Date : 2008-10-13 Size : 8.95kb User : 乐天
[Other] 综合实验哈夫曼编码 DL : 0: 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.
Date : 2008-10-13 Size : 1.62kb User : yy
[Other] 二叉树高度和叶子节点数 DL : 0: 这是一个用来实现二叉树高度和叶子节点数的程序-This is a binary tree used for height and leaf nodes procedures
Date : 2008-10-13 Size : 991byte User : yue
[Other] tree-ron DL : 0: 输入数据，同时实现二叉排序树的生成，根据此树实现各种算法-input data, while achieving binary tree sort of generation, under the tree of various algorithms
Date : 2008-10-13 Size : 33.02kb User : 李海
[Other] bitree111111 DL : 0: 遍历二叉树使用visual c++开发环境（包括创建、插入、删除） -traverse c binary tree using visual development environment (including create, insert, delete)
Date : 2008-10-13 Size : 1.44kb User : chu
[Other] gouzaoerchashu DL : 0: 构造二叉树，简单的排序，图的遍历，希望对大家有用-binary tree structure, the simple sorting, graph traversal, useful for all
Date : 2008-10-13 Size : 7.5kb User : 王全镇
[Other] jiandantudebianli DL : 0: 构造二叉树，简单的排序，图的遍历，希望对大家有用-binary tree structure, the simple sorting, graph traversal, useful for all
Date : 2008-10-13 Size : 1.69kb User : 王全镇
[Other] ThreadedBitree DL : 0: 线索二叉树包括了类声明，创建树，插入节点，删除树等操作。-clues, including a binary tree type statement, create tree node insert, delete, etc tree.
Date : 2008-10-13 Size : 3.75kb User : 哈
[Other] BItree DL : 0: 这是一个源程序，是根据前序和中序来生成一个二叉树的，请站长自己年一下-This is a source, is the former sequence and the sequence to generate a binary tree, please, about their head
Date : 2008-10-13 Size : 4.75kb User : 吴保川
[Other] erchashusuanfa DL : 0: 二叉树算法描述。让你清晰的了解到二叉树的特点。-binary tree algorithm description. You clearly understand the characteristics of a binary tree.
Date : 2008-10-13 Size : 1.54kb User : hxj1984
[Other] ecs DL : 0: 二叉树数据结构我这学期才学的这是我们的实验啊-I binary tree data structure of this semester scholarship This is our experimental ah-huh
Date : 2008-10-13 Size : 36.5kb User : cool
[Other] HanNuoTa DL : 0: 用非递归解决汉诺塔问题采用二叉树查找的方法 made by a___9-non - recursive HANOR solve problems using the binary tree search method made by a___9
Date : 2008-10-13 Size : 1.29kb User : 阿九
[Other] sencongd DL : 0: 主要是运用C＋＋来解决数据结构的问题是一个二叉排序树删除一个节点-is mainly used C + + data structure to solve the problem is a binary tree sort delete a node
Date : 2008-10-13 Size : 1.39kb User : 詹黑哥
[Other] two_trees DL : 0: 这是一个在VC＋＋上开发的二叉树，可以运行！-in VC + + to develop a binary tree, run!
Date : 2008-10-13 Size : 1.67kb User : 梦瑶
[Other] huffman(c) DL : 0: huffman树可以通过输入的权值和结点值来唯一确定。然后根据最优二叉树原理来编码。左孩子的路径上记下0,右孩子记下1-Huffman tree can be imported duty and the right node only to determine value. According to the principle of optimal encoding binary tree. Children left on the path down 0 and the right note of a child
Date : 2008-10-13 Size : 8.25kb User : 本
[Other] Tree+Postorder DL : 0: 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
Date : 2008-10-13 Size : 1.43kb User : xsfh9

« 12 »