数据结构用C语言实现，算法较巧妙

资源描述数据结构图论课后题，对于初学数据结构课程的学生有很大帮助

用c实现的二叉树的中序遍历的读取与存储，能体现出向左倒的二叉树的打印界面，界面简单。-achieved using the binary tree traversal sequence which read and storage, will be shown left one of the binary tree Print interface that simple.

这是一个数据结构的常用算法,是关于字符排序的,输入一串字符用算法实现字符排序-This is a common data structure algorithms, is the sort of character input string of characters with character Sort Algorithm

用c＋＋写的用于ic设计中布图布线的工具源码，采用btree结构，包含文档-using c++ to write for ic design layout source routing tools used btree structure, including documentation

一个实现了三个查找功能的c语言源代码，分别是顺序查找，折半查找和二叉查找树上的查找。可用VC直接编译运行，对查找算法做了很好的演示。-A search function to achieve the three c-language source code, namely, sequential search, binary search and binary search tree to find. VC can be compiled to run directly on the search algorithm has done a very good presentation.

VB实现的三层结构的整体教学实例（少见）

北大OJ 1417题的标程代码，并查集和深度优先搜索的经典实现-OJ 1417 North title scalar-way code and search sets and the classic depth-first search to achieve

Visual+C+++6.0数据库开发技术与工程实践，附源码，下载后请看“光盘说明.txt”再使用。-Visual+ C+++6.0 database development technology and engineering practice, with a source, after downloading, see " CD-ROM instructions. Txt" re-use.

在远距离数据通信中，为确保高效而无差错地传送数据，必须对数据进行校验即差错控制。循环冗余校验CRC(Cyclic Redundancy Check/Code)是对一个传送数据块进行校验，是一种高效的差错控制方法。-in long-distance data communication, in order to ensure efficient without error to transmit data, the data must check that the error control. Cyclic Redundancy Check (Cyclic Redundancy Check/Code) is to block transmission of data over a check out, is a highly efficient error control methods.

最小生成树，使用PRIM方法生成最小生成树。-Minimum Spanning Tree, use the PRIM method to generate minimum spanning tree.