Search - Binary Tree

Search - Binary Tree - List

[Compress-Decompress algrithms] xiansuohua1 DL : 0: 这是一个数据结构的线索二叉树的算法,是用C来编程的-This is a data structure leads to the binary tree algorithm is used to program the C
Date : 2008-10-13 Size : 910byte User : tom
[Compress-Decompress algrithms] lzss_huf DL : 0: 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 contains \"space\" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
Date : 2008-10-13 Size : 3.57kb User : 冰冰
[Compress-Decompress algrithms] 新建 WinZip File DL : 0: 二叉树算法(java)-Binary Tree Algorithm (java)
Date : 2025-12-19 Size : 1kb User : 邰日坤
[Compress-Decompress algrithms] lzss_huf DL : 0: 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 contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.
Date : 2025-12-19 Size : 3kb User : 冰冰
[Compress-Decompress algrithms] xiansuohua1 DL : 0: 这是一个数据结构的线索二叉树的算法,是用C来编程的-This is a data structure leads to the binary tree algorithm is used to program the C
Date : 2025-12-19 Size : 1kb User : tom
[Compress-Decompress algrithms] indices_08_19_96.tar DL : 0: 这是TSVQ的经典实现，在Linux下可以运行。TSVQ是一种高效的压缩和解压缩的方法，基于二叉树的结构来实现，比一般的VQ要好得多。关键代码是mem_tsvqe.c 利用TSVQ实现对原始数据的编码压缩。-This is a classic TSVQ realize, in Linux can be run. TSVQ is a highly efficient compression and decompression method, based on the binary tree structure to achieve, than the average VQ are much better. The key code is the use of mem_tsvqe.c realize TSVQ encoding of raw data compression.
Date : 2025-12-19 Size : 31kb User : 郑中阳
[Compress-Decompress algrithms] Huffman_Expanded DL : 0: 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。-Huffman tree is also called the optimal binary tree is a weighted shortest path length of the binary tree.
Date : 2025-12-19 Size : 68kb User : 陆海表
[Compress-Decompress algrithms] huffmancodeing DL : 0: 霍夫曼編碼，包括編碼解碼二叉樹顯示等功能-Huffman code, including the codec show features such as binary tree
Date : 2025-12-19 Size : 1kb User : shiko
[Compress-Decompress algrithms] compressor DL : 0: 该程序用ＶＣ实现了一个小型文件压缩与解压缩功能的程序，系统中使用静态二叉树，哈希表等数据结构，采用哈夫曼编码进行压缩与解压缩．-VC realize the program with a small file compression and decompression functions, systems use the static binary tree, hash table, such as data structure, the use of Huffman coding for compression and decompression.
Date : 2025-12-19 Size : 10kb User : wennaisong
[Compress-Decompress algrithms] BitTree DL : 0: 提供完整的二叉树的设计文档，设计源代码，方便数据结构的学习-Provide a complete binary tree of the design documents, design source code, data structure to facilitate learning
Date : 2025-12-19 Size : 13kb User : songkaisong
[Compress-Decompress algrithms] BinaryTree DL : 0: 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
Date : 2025-12-19 Size : 2kb User :
[Compress-Decompress algrithms] experiment2 DL : 0: 实现二叉树，DOS显示，帮助大家理解二叉树的建立和存储结构-The realization of binary tree, DOS shows that help people understand the tree establishment and storage structure
Date : 2025-12-19 Size : 128kb User : john
[Compress-Decompress algrithms] BSTREE DL : 0: all traversals in binary search tree with simple coding-all traversals in binary search tree with simple coding..
Date : 2025-12-19 Size : 1kb User : dass
[Compress-Decompress algrithms] huffman_coding DL : 0: ) 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 table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. -) 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 table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
Date : 2025-12-19 Size : 1kb User : ria
[Compress-Decompress algrithms] huff DL : 0: huffman编码以及二叉树的遍历，希望对大家有用-huffman coding, as well as the binary tree traversal
Date : 2025-12-19 Size : 5kb User : wc
[Compress-Decompress algrithms] HuffmanTree DL : 0: 二叉树-哈弗曼树的应用，键盘输入一连串的字符串，最好不要超过10个，回车后输出相应的频率，同时，根据左历变，按顺序输出频率的！！很简单-Binary Tree- Havermann Tree Application
Date : 2025-12-19 Size : 1014kb User : 高阳
[Compress-Decompress algrithms] homework4 DL : 0: AVL Tree （平衡二叉树）功能描述及源文件-AVL Tree (balanced binary tree) function description and source files
Date : 2025-12-19 Size : 3kb User : 黄棱潇
[Compress-Decompress algrithms] Binary_search_tree DL : 0: Binary search tree with the function to add elements and to delete elements
Date : 2025-12-19 Size : 2kb User : bob
[Compress-Decompress algrithms] huffman DL : 0: 赫夫曼压缩解压代码C++编译。VC6环境下运行~采用二叉树结构-Huffman compression decompression code C++ compiler. Run under VC6 binary tree structure ~
Date : 2025-12-19 Size : 2kb User : 黄才开
[Compress-Decompress algrithms] Huffman-Coding DL : 0: 哈夫曼编码(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, often used in data compression. Is the use of a specific character encoding table source (for example, a symbol of a file) to encode
Date : 2025-12-19 Size : 2kb User : chenyuhao

« 12 »