搜索资源列表
xiansuohua1
- 这是一个数据结构的线索二叉树的算法,是用C来编程的-This is a data structure leads to the binary tree algorithm is used to program the C
lzss_huf
- This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially co
新建 WinZip File
- 二叉树算法(java)-Binary Tree Algorithm (java)
BitTree
- 提供完整的二叉树的设计文档，设计源代码，方便数据结构的学习-Provide a complete binary tree of the design documents, design source code, data structure to facilitate learning
BinaryTree
- Implementation of binary tree to use it nclude this header to your project -Implementation of binary tree to use it nclude this header to your project
experiment2
- 实现二叉树，DOS显示，帮助大家理解二叉树的建立和存储结构-The realization of binary tree, DOS shows that help people understand the tree establishment and storage structure
BSTREE
- all traversals in binary search tree with simple coding-all traversals in binary search tree with simple coding..
huffman_coding
- ) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code t
huff
- huffman编码以及二叉树的遍历，希望对大家有用-huffman coding, as well as the binary tree traversal
HuffmanTree
- 二叉树-哈弗曼树的应用，键盘输入一连串的字符串，最好不要超过10个，回车后输出相应的频率，同时，根据左历变，按顺序输出频率的！！很简单-Binary Tree- Havermann Tree Application
homework4
- AVL Tree （平衡二叉树）功能描述及源文件-AVL Tree (balanced binary tree) function descr iption and source files
Binary_search_tree
- Binary search tree with the function to add elements and to delete elements
huffman
- 赫夫曼压缩解压代码C++编译。VC6环境下运行~采用二叉树结构-Huffman compression decompression code C++ compiler. Run under VC6 binary tree structure ~
Huffman-Coding
- 哈夫曼编码(Huffman Coding)是一种编码方式，以哈夫曼树─即最优二叉树，带权路径长度最小的二叉树，经常应用于数据压缩。是指使用一张特殊的编码表将源字符（例如某文件中的一个符号）进行编码-Huffman coding (Huffman Coding) is an encoding, the Huffman tree ─ that is optimal binary tree, the minimum weighted path length of the binary tree, of
huffman
- 构造huffman树，以及找到huffman树的最优解，实现最小二叉树。-Construct huffman tree, and find the huffman tree optimal solution to achieve the minimum binary tree.
linked
- 关于二叉树的一些相关代码，运用链表的形式，求二叉树的高度，结点个数以及叶节点个数-Some of the relevant code on the binary tree, using a linked list, find the height of a binary tree, the number of nodes, and the number of leaf nodes
erchashu5876
- 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-Non-recursive traversal of binary tree: the input binary tree node value from the keyboard and use the binary tree to store binary tree non-recursive algorithm for binary tree t
huff_C_exp2
- 霍夫曼解码，应用二叉树原理，可以下载直接运行-Huffman decoding, the application binary tree principle, you can download directly run
huffmanDecoding
- 霍夫曼解码，二叉树原理，含有丰富注释，帮助你不仅拥有程序，而且容易看懂程序！-Huffman decoding binary tree principle, rich in notes, to help you not only has the program, and easy to understand program!
BiTree
- 实现二叉树的递归前序、中序、后序和非递归前序遍历-Recursive binary tree preorder, inorder, postorder and non-recursive preorder traversal