数据结构典型算法实现，c实现二叉树的遍历以及赫夫曼编码

此程序还不能对字符串排序，望能予以改进-A general soring program.*It can t sort string, and need to be improved.

数据结构中有关单链表操作的源码-data structure of the single-source operating Chain

Prim算法（节点可任意选定） Prim算法（节点可任意选定）-prim algorithm

基于数据库设计一个网页,实现基本功能：增删改、查询、统计报表的功能要有.管理信息-A. General Queries- The system should be able to retrieve useful data stored in the database. B. Statistics Collection- The system should be able to generate useful statistics information. C. Modification of Data- The system should provide interface for the store managers to add, remove and update the data in the database. D. Dealing with special events in the system. Your system should be able to handle real life situations that may arise from running the business. E. You are required to implement a web user interface for your system. F. The user interface should be intuitive and effective to use. G. Please bear in mind that a casual user should not have problems to check some simple information. H. The system should provide an English UI. You can also design multi-lingual UI.

为了方便大家学习数据结构，上传了一本数据结构的电子书供大家参考-In order to facilitate them to learn from the data structure, the upload of a data structure of the e-books for your reference

自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the method, using the right expression Segmentation and recursive input, and this was also a Polish integrity of the conversion process, sound

用C＋＋实现大容量数据的快速读入文件，以及快速写入磁盘！-with C++ realization of the large-capacity, rapid data read from documents, and fast into the disk!

读取的字符一一 ； 忽略任何不是支架的一些种类; 所有左括号内推入堆栈 ； 为每一个右括号，请确保位于堆栈中的类型相匹配的左的括号和弹出 ； 可能会出现三种错误： 到达最后一步输入的现在还有 （左） 括号在堆栈上 ； 你找到一个右括号中输入，但在堆栈的顶部左的一个不匹配 （即，它不是同一种） ； 您尝试匹配一个右括号与左一个从堆栈，但在堆栈为空 ；

平衡二叉树实现一个动态查找表,有三种基本功能:查找,插入删除,还有选项功能:合并两棵平衡二叉树,和分裂两棵平衡二叉树.-balanced binary tree to achieve a dynamic lookup table, there are three basic functions : to find, delete, insert, functional options : merging two balanced binary tree, and split two balanced binary tree.

This code supplements the tutorial in Finite State Machines