本人的练习2的答案， 供大家参考， 希望大家喜欢

可以过来看看有关8皇后的相关算法.这是本人初学数据结构运用堆栈编写的小程序-can come look at the Statue of eight correlation algorithm. This is my beginner stack data structure prepared by the use of small programs

c#编写的一个数据库批量更新小工具。对测试人员来说比较有用。(可以一次性批量添加N条记录）-c# prepared a database batch update gadget. The test more useful for the staff. (You can add a one-time volume records N)

数据结构课程设计，求无向网最短路径，利用c++6.0编程环境-data structure curriculum design, without seeking the shortest path to the net, using c 6.0 programming environment

这是一个简单的实用程序，允许您在不安装MS access的情况下压缩和修复access数据库。对于使用commondialogs和简单的文件复制/删除以及compact&；repair例程的示例来说，它也很好。

数据结构经典：《数据结构基础》 "Fundamentals of Data Structures" 作者：Horowitz 1983年第一版-Classical data structure:

由系统随机建立一个迷宫,然后屏幕输出路径。为在完成作业的同时复习所学过的内容,完成一条路径的时候用到了递归的方法 而做全部路径的时候用非递归的方法。用户界面友好，有用户使用说明.每一步操作都有说明与提示。程序运行通过，有详细的解释说明-system by the establishment of a random maze, and then screen output path. For the complete review of operations at the same time have learned from the contents of a complete path of the use of recursive method to do all the time path of non- recursive method. User friendly interface, users note. Every step of the operation have notes and hints. Running through a detailed explanation of

ORACLE数据库的很好的PPT教程，希望对大家有所帮助-ORACLE database PPT excellent tutorial we want to help

二叉树的建立与遍历 可实现： （1）树的创建采用先序方式，用特殊符号0表示左、右子树为空 （2）每次输入一个节点的值，可以根据自己的需要设计不同的节点结构 （3）节点的值为非零数 （4）可以（）形式输出创建的树 （5）用先序后序和中序遍历树 （6）销毁树 -Establishment and tree traversal can be achieved: (1) tree created using the first order approach, with special symbols 0 express the left and right subtree is empty (2) for each input the value of a node, you can according to their own needs Design of different node structure (3) non-zero value of the node number (4) can () to create the form of the output tree (5) after the first sequence and the sequence of traversal tree (6) the destruction of trees

能够在数据库中存取大的二进制块-to access large databases of binary block

可实现硬币的分法，一分，二分，五分硬币。内附有for循环版-achieve coins points, one points, two points, five coins. Enclosing a version for recycling