db .* (pronounced dee

构造二叉树，对该二叉树中序，先序，后序遍历-Binary tree structure, the binary tree in order, preorder, postorder

本文 ASP 的帮助下，您将学习必要的步骤以输出一个 ASP 页上的文件的源代码。通过小的编码片段中，作者解释了如何使用此 FSO 对象并描述它是如何工作的输出......

快餐管理系统 这个快餐管理系统,实现了实际数据库管理功能,能给相关开发的朋友提供很好的借鉴 -The fast-food fast-food management system management system, the realization of the actual database management functions related to development can provide a very good friend from

SQLite数据库，已经封装成类，支持unicode和非Unicode，可用于嵌入式系统和Windows系统等，包含演示代码-SQLite database, has been packaged into a category, to support unicode and non-Unicode, can be used in embedded systems and Windows systems, including demonstration of the code

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

用VB实现的信用社贷款管理系统的课程设计，可以实现数据库中信息的查询、删除、修改等功能。-Using VB to achieve credit loan management system, curriculum design, can achieve the information in the database query, delete, modify other functions.

这是一个有关数据结构的习题集，里面包含了有关数据结构各个章节的习题以及答案，可以方便同学们下载使用。-This is a set of exercises on data structure, which contains information about data structures, as well as answers to the various chapters of exercises, students can easily download.

数据结构实验，实现多项式乘法，自由输入两个多项式，计算结果并排序。-Experimental data structure, the realization of polynomial multiplication, free importation of two polynomials, the calculation results and sort.

字典树算法，可以很方便的实现多叉树，而且查找很方便，是ACM算法设计中常用的数据结构-Dictionary tree algorithm, can be very convenient multi-tree, and find very convenient is the design of ACM algorithms commonly used data structure

校园导游图算法--数据结构中有关图的算法 按v求最短路径 按s求信息； 按q退出； 地图在map图像文件里-campus tour map algorithm-- data structure of the plan according to the algorithm for the shortest path v s by seeking information; Q withdrawal by; Maps map image file