搜索资源列表
ERCHASHU
- 关于二叉树的一些基本操作，包括查找，添加，删除结点-About some of the basic binary tree operations, including search, add, delete node and so on
hafuman
- 哈夫曼编码为实现哈夫曼编码，先构造哈夫曼树。哈夫曼树的每个节点都存有该节点的信源符号，概率，双亲节点，左孩子节点和右孩子节点。每个节点的概率为该节点左孩子节点和右孩子节点的概率之和。每次选取概率最小的两个节点作为左右孩子节点，直到把所有的数据都整合到哈夫曼树中。每个原始数据都处于叶子节点的位置。-Huffman coding Huffman coding to achieve the first Huffman tree structure. Huffman tree for each node
HuffmanTree
- 根据哈夫曼算法，建立哈夫曼树时，可以将哈夫曼树定义为一个结构型的一维数组HuffTree，保存哈夫曼树中各结点的信息，每个结点包括：权值、左孩子、右孩子、双亲-Huffman algorithm Huffman tree is created, the Huffman tree is defined as a structure of one-dimensional array HuffTree, save the information of Huffman tree nodes, each
hh
- 文本为一个用c语言编写用于产生一个二叉树的源码文本。以三元组形式输入任意二叉树（以大写字母表示结点），求以任意一选定结点为子树的深度。-Text for a c language is used to generate a binary tree of the source text. Enter any form of triples binary tree node (in capital letters), and demand in any one selected node subtr
vbdatabase
- 为树状浏览器控件添加节点和子节点 用ADD方法添加一个新节点到树状浏览器的NODES集合时，可以声明它是和已存在的节点所联系起来的。通常使用ADD方法，-Add nodes and sub-nodes with ADD method to add a new node to the tree browser NODES collection tree browser controls can be declared and existing nodes linked. Usual
tree
- 树的相关操作，先序遍历建立二叉链表，左右孩子交换，二叉树中叶子节点个数算法，统计以值为x的结点为根的子树中叶子结点的数目，按树状打印二叉树-Tree-related operations, first traversal establishment of binary list, so the child exchange, the number of leaf nodes in a binary tree algorithm, the statistical value of x to a n
min-tree
- 最小生成树权值计算的源代码，输入结点个数，和各结点之间用三元法表示的权值，利用算法计算最小生成树-Minimum spanning tree weight calculation of the source code, the right to use the ternary notation of the number of input values between nodes, and each node using the minimum spanning tr
30132160472
- 现在要对一棵二叉树的节点进行染色。每个节点可以被染成红色、绿色或蓝色。并且，一个节点与其子节点的颜色必须不同，如果该节点有两个子节点，那么这两个子节点的颜色也必须不相同。给定一棵二叉树的二叉树序列，请求出这棵树中最多和最少有多少个点能够被染成绿色。-Now to node of two binary tree were stained. Each node can be dyed red, green or blue. Moreover, a node and its child nodes m
Huffman
- 哈夫曼编码:从键盘输入若干字符及每个字符出现的频率，将字符出现的频率作为结点的权值，建立哈夫曼树，然后对各个字符进行哈夫曼编码，最后打印输出字符及对应的哈夫曼编码。-Huffman coding: the frequency of occurrence of several characters inputted the keyboard and for each character, the character appears as a frequency node weights, the