Search - binary AND tree

Search - binary AND tree - List

[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] 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 : 2026-01-01 Size : 3kb User : 冰冰
[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 : 2026-01-01 Size : 31kb User : 郑中阳
[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 : 2026-01-01 Size : 10kb User : wennaisong
[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 : 2026-01-01 Size : 128kb User : john
[Compress-Decompress algrithms] homework4 DL : 0: AVL Tree （平衡二叉树）功能描述及源文件-AVL Tree (balanced binary tree) function description and source files
Date : 2026-01-01 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 : 2026-01-01 Size : 2kb User : bob
[Compress-Decompress algrithms] include DL : 0: 哈夫曼编码的应用很广泛，利用哈夫曼树求得的用于通信的二进制编码称为哈夫曼编码。树中从根到每个叶子都有一条路径，对路径上的各分支约定：指向左子树的分支表示“0”码，指向右子树的分支表示“1”码，取每条路径上的“0”或“1”的序列作为和各个对应的字符的编码，这就是哈夫曼编码。-Huffman coding application is comprehensive, the use of Huffman tree obtained is called binary code used for communication Huffman coding. Tree from the root to each leaf has a path, the path of each branch of the convention: the left sub-tree branches that said " 0" code means that the right sub-branch of the tree, " 1" bit, take each path " 0" or " 1" and each corresponding to a sequence of characters as the encoding, which is Huffman coding.
Date : 2026-01-01 Size : 17kb User : 王一
[Compress-Decompress algrithms] huffman DL : 0: 构造huffman树，以及找到huffman树的最优解，实现最小二叉树。-Construct huffman tree, and find the huffman tree optimal solution to achieve the minimum binary tree.
Date : 2026-01-01 Size : 817kb User : 刘开宇
[Compress-Decompress algrithms] linked DL : 0: 关于二叉树的一些相关代码，运用链表的形式，求二叉树的高度，结点个数以及叶节点个数-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
Date : 2026-01-01 Size : 9kb User : 黄永洪
[Compress-Decompress algrithms] erchashu5876 DL : 0: 非递归中序遍历二叉树：要求从键盘输入二叉树各结点的值，并使用二叉链表来存储二叉树；使用非递归算法遍历二叉树，在屏幕上打印出二叉树中序遍历序列。-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 traversal, print out the binary tree traversal sequence on the screen.
Date : 2026-01-01 Size : 1kb User : Grape
[Compress-Decompress algrithms] huffmanDecoding DL : 0: 霍夫曼解码，二叉树原理，含有丰富注释，帮助你不仅拥有程序，而且容易看懂程序！-Huffman decoding binary tree principle, rich in notes, to help you not only has the program, and easy to understand program!
Date : 2026-01-01 Size : 329kb User : cjm
[Compress-Decompress algrithms] BiTree DL : 0: 实现二叉树的递归前序、中序、后序和非递归前序遍历-Recursive binary tree preorder, inorder, postorder and non-recursive preorder traversal
Date : 2026-01-01 Size : 233kb User : 猪猪
[Compress-Decompress algrithms] ercha-shu DL : 0: 数据结构（C语言）二叉树）的实现欢迎分享与交流-Data structure (C language) binary tree) to achieve welcome to share and exchange
Date : 2026-01-01 Size : 1kb User : 张大雷
[Compress-Decompress algrithms] Huffman DL : 0: 1.基本上已经完成压缩及解压缩操作的代码实现。解压缩时关键还是文件流的操作，读取内容时采用逐字节读取，把0－255的十进制整数转化为二进制数，利用这些二进制数从哈夫曼树的根结点出发，0走左子，1走右子，找到叶子结点，把该叶子结点的下标写入新文件，最后处理有效位数不满8位的字节-1 basically completed the compression and decompression code implementation. Decompression is the key stream file operation, read the byte by byte read and the 0- 255 decimal integer transformation as a binary number, using the binary number starting the root node of the Huffman tree, 0 go left, 1 walk right, find a leaf node, the subscript of the leaf node is written to a new file, the effective number of bits 8 bits of the byte discontent
Date : 2026-01-01 Size : 3kb User : chenchen
[Compress-Decompress algrithms] main DL : 0: 哈夫曼树，二叉哈夫曼树的建立（两种方式），以及三种遍历方式（递归与非递归）-The haffman tree, the creation of the binary hafman tree (two ways), and the three ways of traversing (recursion and non-recursion)
Date : 2026-01-01 Size : 2kb User : cheese
[Compress-Decompress algrithms] huffman DL : 0: 基于赫夫曼树的压缩算法二进制读入文件，对txt有较好压缩效果，而对MP4、pdf等已经被处理过的文件格式效果不不明显。但是是初学者很好的学习资料。(The compression algorithm based on Huffman tree Binary read into the file, TXT has a better compression effect, and MP4, PDF has been processed file format effect is not not obvious. But it's a good learning material for beginners.)
Date : 2026-01-01 Size : 765kb User : 絮缘