车厢重排,一个c++数据结构习题

使用ADO对比较大的数据进行操纵-use ADO contrast to the larger data manipulation

创建一棵二叉树，采用前序遍历的方法建立一棵树，传递的参数为一个指向结点的指针的指针，目的是为了解决传值的问题，输入@符号的时候，表示一棵子树结束线索化二叉树，寻找当前结点的后继结点，寻找当前结点的前驱结点，中序遍历 -create a binary tree using preorder before the establishment of a tree. transmission parameters of a point to the node pointer, the purpose is to solve the problem of traditional values, the importation of the @ symbol, said the end of a tree-binary tree of clues to find the current node"s successor nodes, for the current node precursor nodes, China preorder

图书管理系统源代码及报告分析，图书管理系统源代码及报告分析-Library management system source code and reports analysis, library management system source code and reports analysis of

创建一个链表，逆向输出链表，两个链表的合并的vc程序编程实现代码。-create a linked list, reverse output chain and the two combined Chain vc programming code to achieve.

数据结构-次索引的建立-data structure-building meeting Index

动态加载odbc数据源及其内部表单的小程序-Dynamic loading odbc data source and its internal form of small programs

SQL Server 7.0开发指南，很好的电子书籍。有兴趣的朋友看看吧。-Guide to the development of a good e-books. Interested friends to see it.

编程求两个一元多项式的乘积。 输入 　　输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（整数）。 　　例如：1+2x+x2表示为：,,, 输出 　　以指数递增的顺序输出乘积： ,,, 　　零多项式的输出格式为：,-Programming seeking the product of two one-polynomial. Enter the input data for the two lines represent two unary polynomial. One dollar for each polynomial order of the exponential increase of the input polynomial coefficients (integer), index (integer). For example: 1+2 x+ x2 expressed as: " 1,0" , " 2,1" , " 1,2" , the output of the order of the exponential increase output of the product: " coefficient, index" , " coefficient, index" , " coefficient, the index " , zero polynomial output format is:" 0,0 " ,

最短路径 迪杰斯特拉 最短路径 迪杰斯特拉-Shortest Path Floyd Shortest Path Floyd

企业信息管理系统包含信息录入，信息查询，信息统计等多项功能。-Enterprise Information Management System contains information input, information inquiry, information statistics and many other features.