Description: 一个多项式运算程序 实现多项式的加 减 乘除 乘方 积分 微分 混合运算
一个二叉树运算程序 实现二叉树的创建 复制 深度计算 和树形显示
一个哈夫曼算法的演示程序 实现对电文的编码 编码的输出 和编码的还原
程序共三个 模块已经超过了五个 没有分开写-Operational procedures for the realization of a polynomial polynomial addition and subtraction, multiplication and division involution mixed integro-differential operator realization of a binary tree binary tree computing process of the creation of copy depth calculation and display a Huffman tree algorithm demo program to realize the message coding coding and coding the output of the restore process a total of three modules have been no more than five separate write Platform: |
Size: 11264 |
Author:张赛 |
Hits:
Description: 一份huff_tc.c，只能在tc下运行，因为加入了用tc图形界面直观画出树形的代码。一份是huff_vc.c,是在vc和tc下都能运行的程序，没有直观表达编码的树形结构。
[目的]
构建所输入符号（及权值）的哈夫曼树，并利用该树求出各符号的编码，深入理解最优二叉树的概念及其特性。
[问题描述]
读入各个符号及其权值，求各符号的哈夫曼编码。
[基本要求]
（1）读入各个符号及其权值，建立哈夫曼树；
（2）利用建立的哈夫曼树对各符号进行编码，输出编码结果。
[选做内容]
将所建立的哈夫曼树以直观的方式（树或凹入形式的表）显示。
-huff_tc.c, can only run at tc, because using the add tc intuitive graphical interface to draw tree code [Objective] To construct the input symbols (and the right value) of the Huffman tree, and use the tree to derive the coded symbols, in-depth understanding of the concept of optimal binary tree and its characteristics. [Problem Description] read into the various symbols and their weights, and Huffman coding of the symbols. [Basic requirements] (1) read into the various symbols and their weights, Huffman tree set up (2) the use of the Huffman tree for the set up of the symbol encoding, output encoding results. [Does the content of the election] will be set up by the Huffman tree to intuitive way (tree or indentations in the form of the table) shows. Platform: |
Size: 3072 |
Author:李霄逍 |
Hits:
Description: 本程序建立了哈夫曼树并求出了各字符哈夫曼编码，但不能对需要编码的文件进行分析，作出最优或
近似最优的决策
建树的时间复杂度:O(nlogn)
求解编码的平均时间复杂度:O(n*d)
d为哈夫曼树叶子的深度的期望，最坏情况的d=(n^2+n-2)/2n.
编码的最坏时间复杂度为O(n^2)-This procedure established a Huffman tree and calculated the various characters in Huffman coding, but not on the need for analysis of encoded files to make the optimal or near optimal policy-making achievements of the time complexity: O (nlogn) Solution encoding The average time complexity: O (n* d) d is the depth Huffman leaves the expectations, the worst case of d = (n ^ 2+ n-2)/2n. encoding the worst time complexity O (n ^ 2) Platform: |
Size: 2048 |
Author:刘晓明 |
Hits:
Description: 构造哈夫曼树，应用深度优先与广度优先搜索……测试无误，欢迎交流-Huffman tree construction, application of depth first and breadth first search ... ... the test is correct, welcomed the exchange of Platform: |
Size: 1024 |
Author:陆云 |
Hits:
Description: 构建所输入符号（及权值）的Huffman树，并利用该树求出各符号 的 Huffman编码，深入理解最优二叉树的概念及其特性。
-Construction of the input symbols (and weight) of the Huffman tree and the tree obtained using Huffman coding of the symbols, in-depth understanding of the concept of optimal binary tree and its characteristics. Platform: |
Size: 143360 |
Author:gaoyuan |
Hits:
Description: 《大话数据结构》主要内容包含：数据结构介绍、算法推导大O阶的方法；顺序结构与链式结构差异、栈与队列的应用；串的朴素模式匹配、KMP模式匹配算法；二叉树前中后序遍历、赫夫曼树及应用；图的深度、广度遍历；最小生成树两种算法、最短路径两种算法；拓扑排序与关键路径算法；折半查找、插值查找、斐波那契查找等静态查找；稠密索引、分块索引、倒排索引等索引技术；冒泡、选择、插入等简单排序；希尔、堆、归并、快速等改进排序-" Westward the data structure," the main contents include: Introduction of data structures, algorithms, Big O-order method is derived sequence differences in the structure and chain structure, the application stack and queue series of simple pattern matching, KMP pattern matching algorithm binary ago in post-order traversal, Huffman tree and applications map the depth, breadth traversal minimum spanning two algorithms, the shortest path of two algorithms topological sort and critical path algorithm binary search, interpolation search, Fibonacci search Find other static dense index, block index, inverted index and other indexing techniques bubble, selection, and other simple insertion sort Hill, heap, merge, quick sorting and other improvements Platform: |
Size: 1531904 |
Author:陈雨 |
Hits:
Description: 北邮复试上机题：赫夫曼编码
给出n个有权值的结点，构造赫夫曼树，输出所有这n个结点的权值与其赫曼编码长度（即该结点在所构造的赫曼树中的深度）的乘积的总和。
Input
第一行是一个正整数n，表示一共有n个结点。
第二行为n个整数，分别表示这n个结点的权值。
Output
输出所有这n个结点的权值与其赫曼编码长度的乘积的总和。
Sample Input
5
1 2 2 5 9
Sample Output
37-
Huffman coding
The product of the given n right nodes construct the Huffman tree, the output of all n-vertex weights and their Herman coding length (that is, the junction depth in the constructed Herman tree,). combined.
Input
The first line is a positive integer n represents a total of n nodes.
The second line of n integers, respectively, an n-vertex weights.
Output
Output of all n-vertex weights and their coding Herman length sum of the products.
Sample Input
5
12259
Sample Output
37 Platform: |
Size: 2048 |
Author:Jeniffer1 |
Hits:
Description: 1．掌握二叉树的基本概念和性质
2．掌握创建和构造二叉链表的算法
3．掌握二叉树链表存储基础的的三种递归遍历算法和非递归算法。
4．掌握计算二叉树的结点、二叉树的深度和二叉树的叶子结点数等算法。
5．掌握huffman树的构造和编码。
实验要求：（1）理解二叉链表的初始化、二叉树空的判断；（2）理解二叉树的遍历算法，掌握其应用。
-A. Grasp the basic concepts and properties of the binary tree. Master to create and construct a binary linked list algorithm. Master binary tree linked list is stored based on the three recursive traversal algorithm and non-recursive algorithm. 4. To master computing node of the binary tree algorithm of depth of the binary tree and binary tree leaf nodes. 5 Master the structure and encoding of the huffman tree. Experiments: (1) to understand the judgment of the initialization of the binary linked list, binary tree empty (2) understand the binary tree traversal algorithm, and control over their applications. Platform: |
Size: 20480 |
Author:刘国佳 |
Hits:
Description: 这段编码实现了霍夫曼树的基本编码，可以说是数据结构的一些浅显应用，为以后深入研究打好了基础
-Basically， encoding basic coding Huffman tree, we can say some simple and obvious application of the data structure, lay the foundation for future in-depth study Platform: |
Size: 1024 |
Author:邵礼 |
Hits:
Description: 1.实现二叉树的下列运算:
[1]输入一个二叉树的先序序列，生成二叉树的二叉链表
[2]显示其先序、中序和后序遍历结果。
[3]计算二叉树的叶子结点数。
[4]求二叉树的深度
2.编程实现二叉树的层次遍历
3.哈夫曼编码-1.operational binary tree:
[1] Enter a first sequence binary tree sequence, generating a binary tree binary list
[2] show its first order, sequence and after preorder results.
[3] calculated binary tree leaf nodes.
[4] binary tree of depth
2. Programming level binary tree traversal
3. Huffman coding Platform: |
Size: 264192 |
Author:王玥天 |
Hits:
Search - huffman tree depth