霍夫曼编码前缀编码Huffman Coding

应用vc编写的数据库管理程序-prepared by the database management procedures

方便使用，功能齐全，放心使用量不要让站长把时间都花压缩包解压时不能有密码-Easy to use, full-featured, secure and use not to let the owners have spent their time there can not be compressed package decompression password

遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化. -traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.

有各种排序算法，比如直接排序，快速排序，希尔排序和选择排序，二叉树排序，链表排序-There are various sorting algorithms, such as direct sequencing, Quick Sort, Hill sort and select sort, tree sort, sort list

这是一个霍夫曼编码解码的源程序,可以用它高效实现霍夫曼解码编码,注释详细,可读性好.压缩包止包括源程序文件,再vc中运行.-Hoffman codec of the source, can be used to achieve efficient codec Hoffman Notes detailed and readable. Compressed only those source files, then vc run.

倒置一个单链表，链表是带有头结点的单链表，通过不断在表头插入结点，使链表有序-Inversion of a single linked list, linked list is the first node with a single list, through constant head inserted in the table node, so that an orderly list

这个是数据结构经典实现算法，是一些很不错的算法-shu ju jie gou jing dian suan fa shi xian

主要是用在学校里记录学生考试成绩，方便学生和老师在网上对成绩进行查询

access转换为execl,方便打印报表-access into execl facilitate print statements, etc.

编译系统： Visual C++ 6.0 操作系统： Windows 2000/XP 这几个程序对于学习和理解数据结构有很大的帮助。-Compiler System : Visual C 6.0 operating system : Windows 2000/XP these procedures for the study and understanding of data structure will be very helpful.