初学者学习c语言数据结构的编码，

二叉排序树，包括插入节点、删除节点、中序线索化、中序遍历等功能-Binary sort tree, including the insert node, delete node, in the sequence of clues, in the traversal functions

数据结构课程的作业，代码通俗易懂，且运行效率高。-Data structure course work, the code easy to understand, and operating efficiency.

登录

1、为病人提供更好更快、更快的服务，提高医院在医疗市场的竞争力以及吸引更多的病人到本医院就医； 2、人力工资昂贵，迫使医院采用计算机以提高劳动效率； 功能：1、门诊挂号：为病人提供就医卡方便病人； 2、住院病人管理系统：是医院可以随时了解病人情况； 3、药房管理系统：提高了药品管理的质量，和工作效率； 4、门诊医生工作站、住院费用的管理、病历管理系统、以及外部接口等。-1, for providing patients with better and faster and more efficient services and improve the hospital in the medical market competitiveness and to attract more patients to the hospital 2, manpower, high cost of labor, forcing hospitals to improve the working efficiency of the computer function : 1, out-patient registration: In order to provide patients with the convenience of patients for medical treatment card 2, patients management system: a hospital patient can understand 3, pharmacy management system: To improve the quality of drug management, and efficiency 4, the doctor-patient workstations, the cost of hospital management, medical records management system, as well as external interfaces.

sqlite是一种嵌入式数据库。本文件包含了操作此数据库的一个类。该类实现了sqlite的所有操作，并具有良好的注释说明。-sqlite is an embedded database. This document contains the operation of this database, a class. Sqlite class implements all the operations, and has a good explanatory notes.

根据一段给定的文章构造哈夫曼树并对一段给出的代码译码成为一段文章，输入输出均通过文件来实现，并配有报告文档。-According to the article section of a given structure of the Huffman tree is given a section of the code decoding to become a section of articles, input and output are achieved through the document and the document with the report.

求最短路径的C++ 源代码 ，用很简单的数据结构实现的，运行速度很快-The shortest path for the C++ Source code, using very simple data structure to achieve, to run fast

查询给定编号查询信息，可用于sqlsever的数据库管理-Look for a given number query information

基数排序：思想:先从数据的低位开始,进行分配,分成10个空间,分别存储位为,0,1,2,3...9 重复的对次地位操作,知道预定的高位,排序完成-Radix Sort: thinking: from data low starting distribution, divided into 10 space, storage spaces, respectively, for 0,1,2,3 ... repeated 9 times the status of the operation, to know the scheduled high ranking completed

this is fp tree algorithm in java