Search - binary AND tree

Search - binary AND 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] 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] 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] 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] zupushu DL : 0: 家族族谱二叉树，实现同辈查询，儿女查询，-family genealogy binary tree, achieving peers inquiries, the sons and daughters of inquiries,
Date : 2008-10-13 Size : 2.51kb User : ananbo
[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
[Other] HUFFMANT DL : 0: 一个哈夫曼树的C代码一个猜数字游戏C实现以及一个二叉树C实现经过BOLAND2.0调试运行成功-a Huffman tree C code a ringing C game and achieve a binary tree after realizing C BOLA Debugging successful running ND2.0
Date : 2008-10-13 Size : 1.65kb User : hujingpaper
[Other] jianshu DL : 0: 建立二叉树,实现二叉数的遍历和查找结点,输出结点值等-establish binary tree, few realized the two forks traverse and search node, the output node value
Date : 2008-10-13 Size : 1.17kb User : 悠悠
[Other] careerman DL : 0: 第1题_向量链表功能应用.txt 第2题_双向链表功能应用.TXT 第3题_扩充双向链表的功能.TXT 第4题_二叉树功能应用.TXT 第5题_利用二叉树功能解决实际问题.TXT 第6题_利用二叉树进行四则运算.txt-an article that _ Vector Chain function application. Txt No. 2 _ and that two-way linked list functional applications. TXT No. 3 _ and that the expansion of two-way Chain function. TXT 4 _ that function application binary tree. TXT No. 5 _ and that the use of binary tree functions to solve practical problems. TXT 6 that _ use binary tree for four computing. txt
Date : 2008-10-13 Size : 92.86kb User : 赵文明