Description: 实现数据的压缩，演示Huffman二叉树的应用。虽然压缩效果不如rar等，但是作为一种算法，具有可借鉴的价值。-data compression, presentations Huffman binary tree applications. Although not rar compression, but as an algorithm that can draw is the value. Platform: |
Size: 6613 |
Author:祝桦岸 |
Hits:
Description: 这几个是本人整理的.cpp程序，您可以借鉴参考------>> dos前景背景色设置.cpp 二．八．十．十六进制转换程序的函数.cpp 二叉树的遍历.cpp 图形的广度优先搜寻法.cpp 图形的深度优先搜寻法.cpp 用C语言编的一个日历.c-these are my finishing. Cpp and you can draw reference --- gt; Gt; Dos prospects for the background color set. Cpp two. 8. 10. Hexadecimal conversion function. Cpp binary tree traversal. Cpp graphics priority to search for the breadth of France. Cpp graphics depth-first search of the law. Cpp C language compile a calendar. C Platform: |
Size: 7166 |
Author:丁志强 |
Hits:
Description: 数据结构中的二叉树,二叉排序树,遍历左右孩子,输入数值划出圆-data structure, the binary, binary sort tree traversal around children, the importation of numerical round draw Platform: |
Size: 1950 |
Author:yang |
Hits:
Description: 这几个是本人整理的.cpp程序，您可以借鉴参考------>> dos前景背景色设置.cpp 二．八．十．十六进制转换程序的函数.cpp 二叉树的遍历.cpp 图形的广度优先搜寻法.cpp 图形的深度优先搜寻法.cpp 用C语言编的一个日历.c-these are my finishing. Cpp and you can draw reference--- gt; Gt; Dos prospects for the background color set. Cpp two. 8. 10. Hexadecimal conversion function. Cpp binary tree traversal. Cpp graphics priority to search for the breadth of France. Cpp graphics depth-first search of the law. Cpp C language compile a calendar. C Platform: |
Size: 7168 |
Author:丁志强 |
Hits:
Description: 数据结构中的二叉树,二叉排序树,遍历左右孩子,输入数值划出圆-data structure, the binary, binary sort tree traversal around children, the importation of numerical round draw Platform: |
Size: 2048 |
Author:yang |
Hits:
Description: 实现数据的压缩，演示Huffman二叉树的应用。虽然压缩效果不如rar等，但是作为一种算法，具有可借鉴的价值。-data compression, presentations Huffman binary tree applications. Although not rar compression, but as an algorithm that can draw is the value. Platform: |
Size: 6144 |
Author:祝桦岸 |
Hits:
Description: 动态演示各种数据结构的定义和操作:
实现过程:
建立一棵二叉树，并在所建立的二叉树中可在任意结点位置插入其左右孩子。
画出你所建的这棵二叉树，并能动态反映你所插结点的过程（具有可视化，彩色，美观的效果）
能查找任一结点的左右孩子
能查找任一结点的左右邻兄弟
能查找任一结点的父亲
能删除任一结点
能对树进行各种遍历-Dynamic demonstration of the definition of various data structures and operations: the realization of the process: the establishment of a binary tree and binary tree created can be in any position to insert node about its children. Draw your tree built binary tree, and you can dynamically reflect the process of interpolation nodes (with a visualization, color, aesthetic effects) can search any one node around children can search for any node o brothers around the search term can be the father of one node can delete any node can conduct various kinds of tree traversal Platform: |
Size: 13312 |
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: 二叉树先序、中序、后序之间的转换。已知其中两种，来得出并在图形界面中绘制二叉树。-First order binary tree, in order, the order of the transition between. Two of which are known to come and draw a binary tree in a graphical interface. Platform: |
Size: 23552 |
Author:Anna |
Hits:
Description: 假设一颗二叉树的先序序列为EBADCFHGIKJ和中序序列为ABCDEFGHIJK，请画出该树-Assuming a binary sequence of the first order and the order for the EBADCFHGIKJ sequence ABCDEFGHIJK, please draw the tree Platform: |
Size: 1024 |
Author:guanguan |
Hits:
Description: 画出一棵二叉树，写出按照initial()函数建立该二叉树的字符序列。编写一个程序能建立一棵二叉树，并求所有叶子及结点总数。-Draw a binary tree, write in accordance with the initial () function to establish the sequence of characters of the binary tree. Write a program to establish a binary tree, and ask all the leaves and the total number of nodes. Platform: |
Size: 1024 |
Author:Reggie |
Hits:
Description: 已知中序和后序遍历，求前序遍历.比较笨的方法是画出来二叉树，然后根据各种遍历不同的特性来求，也可以编程求出.-Known inorder and postorder traversal, seeking preorder traversal. Stupid way is to draw out the binary tree, and then iterate based on a variety of different features to find, but also can be programmed to calculate. Platform: |
Size: 1024 |
Author:tscorner |
Hits:
Description: 某年某月，A军与B军之间发生了一次战争。为了不让A军轻易的找到自己的总部，B军布下了一个二叉树型的阵形，这样既可以相互沟通，也可以很好的隐藏总部的位置。共有n个节点，每个节点用一个数字标号，总部就在其中的某个节点处。知道在前序遍历中B军总部排在标号串的第m位。
A军找到学过数据结构的你，请你根据已知的中序遍历和后序遍历得到B军的前序遍历，并得出B军总部究竟在标号为多少的节点上。
-A certain period, A B between army troops and a war breaks out. A military order to prevent easily find their headquarters, B Army planted a binary tree type of formation, so that both can communicate with each other, but also can be a good hiding spot headquarters. A total of n nodes, each with a numbered, headquartered in one of these nodes. Know the former military headquarters preorder in row B in the first m-bit string label. A military find data structures you have learned, you get the pre-order traversal B Army based on known preorder and postorder traversal, and draw B army headquarters on exactly how much the node labeled. Platform: |
Size: 641024 |
Author:周 |
Hits:
Search - draw binary tree