Search - Binary Tree

Search - Binary Tree - List

[Crack Hack] Yuesefu DL : 0: 树里求祖先结点的算法,RSA加密,二叉树,括号匹配,约瑟夫环,ID-Tree for ancestral nodes algorithm, RSA encryption, binary tree, parentheses matching, Joseph Central, ID
Date : 2025-12-19 Size : 8kb User : oth
[Crack Hack] DES DL : 0: 用C编写的DES加密算法，通过运行。其中运用二叉树实现，只是例子，并不通用。为word格式。 -C prepared by DES encryption algorithm, by running. Which the realization of the use of binary tree, only examples, not generic. For the word format.
Date : 2025-12-19 Size : 6kb User : 郑正
[Crack Hack] HuffmanCodes DL : 0: Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. 3.This problem can be solved by using an extended binary tree which is used in the 2-way merging problem. the sourse code is to encode and decode the Huffman.
Date : 2025-12-19 Size : 150kb User : 黃文岩
[Crack Hack] jianerchashu DL : 0: 建立二叉树以便进行查找等功能采用从文档中读取数据-For the establishment of binary tree used to find features such as data read from the document
Date : 2025-12-19 Size : 3kb User : lb
[Crack Hack] Maptheepthoftraversal DL : 0: 数据结构对二叉树的深度遍历用进栈，出栈的方法。-The depth of the binary tree data structure traversal to use into the stack, a stack method.
Date : 2025-12-19 Size : 2kb User : hujiao
[Crack Hack] ztrees DL : 0: *讨论 * 本PKZIP“通缩”的过程中使用了几个哈夫曼树。越 *共源的值由短比特序列表示。 * *每个代码树存储在ZIP文件以压缩形式 *这是本身的长度的霍夫曼编码 *所有的代码串（按升序排列按来源值）。 *实际代码串从长度重构 *解压缩过程中，如在“应用指南”中描述 *（APPNOTE.TXT）分布情况的PKWARE的PKZIP的计划的一部分。-* trees.c by Jean-loup Gailly * * This is a new version of im_ctree.c originally written by Richard B. Wales * for the defunct implosion method. * * PURPOSE * * Encode various sets of source values using variable-length * binary code trees. * * DISCUSSION * * The PKZIP deflation process uses several Huffman trees. The more * common source values are represented by shorter bit sequences. * * Each code tree is stored in the ZIP file in a compressed form * which is itself a Huffman encoding of the lengths of * all the code strings (in ascending order by source values). * The actual code strings are reconstructed the lengths in * the UNZIP process, as described in the application note * (APPNOTE.TXT) distributed as part of PKWARE s PKZIP program.
Date : 2025-12-19 Size : 11kb User : ShichaoLiang