数据结构的教程

数据结构习题答案，比答案册还要简单。经多人修改而成。-data structure answer the questions than answers List also simple. After many revisions.

二叉树排序代码，动态生成二叉树，进行动态查找-Binary tree sort code, dynamically generated binary tree, dynamic search

C语言常用算法源代码,非常好用非常好用-C language source code commonly used algorithm, a very handy very handy!

8皇后问题-8 Queen

c数据结构的经典示例

如何将ABCDEFG按照指定的顺序，创建二叉树，-How to ABCDEFG in accordance with the order specified to create binary tree,

《Visual C++.NET数据库开发经典案例解析镜像光盘》随书光盘代码。-visual c++.net

十字链表，可实现插入，删除，保存，恢复等功能-Cross linked lists, can be insert, delete, save and restore 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.

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.