这是数据结构算法中的栈的实现的源码。用C++开发。

这是一些c语言的常用算法，它可以帮助那些初学c语言的人了解c语言的算法的写法和怎么用的啊-c language commonly used algorithm, it can help those learning the language c c language people understand the wording of the algorithm and how the ah! !

计算机科班学生的数据结构课的-‘表’（VC写的源程序）-computer classes to the students of the class of data structure-the "Table" (VC was made of the source)

fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpogg ；fsadfsdfsddfgdgfg dfgfgfg sdfg dsdfg gsdfg gsdfg sdfgsdfg gdfgsdfg gdgfgsdfg gdfsjkldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posggoipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfg sdfop gisdfpog fsdfsadfsdgfg dfgdgfg dsfg sdfg dsf gsdfg sdfgsdfg sdfgsdfg gfd g gjdflskgksd gdfsjklgsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig goipf gdfog opsdf gspdo sdfpo gisdf gpsdfog ipsdfpog；fsdfsadfsdfsdfsdgdgdgfg dsfg sdfg dsf gsdfg sdfgsdfg gddflskgksd gdfsjklgjklsd kldfg jsdfj klgsfsgfsgjkl；sg dfg osdpg posdfig ；goipdf gdfpogsdf opsdf gspdo sdfpo gisdf gpsdfog ipsdfop gisdfpog ；

Linux下的操作oracle数据库的连接库-Linux operating oracle database library

汉诺塔是初学数据结构的同学最头疼的问题，这里是一个用递归函数解决汉诺塔问题的经典c语言程序，里面有代码和执行文件。-HANOR data structure is that when the students most headaches, here is a solution using a recursive function HANOR a classic c language program, which has code and the implementation document.

递归算法，很经典的移盘算法源代码，请用vc编译运行。-Recursive algorithm, it is the classic disk-shift algorithm source code, please use the vc compiler to run.

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree

教学管理系统 简单实用的校园学生档案管理系统-Teaching Management System Campus students simple file management system

主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前、中、后、层次遍历和相关的操作。另外，可以树形显示这棵树的信息。-Some properties are mainly binary operation. Including reproduction, empty, to strike a tree height, the number of elements in the tree get root node, the father node, all the ancestors, the left son, right son, insert the left son, right son, to find an element, and the former , during and after, hierarchical traversal and related operations. In addition, you can display tree tree information.

数据结构 详细描述了如何创建二叉树的方法以及操作-Data structure described in detail how to create a binary tree method and the operation of