chain operation and Primbetov algorithm demo, easily comprehensible algorithms.

建立并按前,中,后序方法遍历二叉树,本代码用的是非递归方法,递归方法的稍后给出-established as before, during and after the binary tree traversal sequence method, the code of non- recursive method, recursive method is later

程序设计：哈希表的一个应用-Program Design : Hash Table 1 Application

建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-table with the establishment of the first node of a single linked list, print all nodes of the data domain; An input value, If a node"s data fields for the values, and subsequently inserted in a new node, in the absence of such nodes, at the end of the insertion of a new form nodes, then Print; to a value of the node to delete data domain is the value of all the nodes, then Print. (Table Generation available houses or after interpolation)

打开数据库中的记录，并且实现浏览数据库的功能-open the records in the database and view the database

The existed tree implementation-implementation

最段路径算法C++实现 实现工程清晰可见 仅供参考-Most paragraphs path algorithm C++ Realize realize the project clearly visible for reference only

实现基于二叉树表示的算术表达式实现基于二叉树表示的算术表达式-eeeeaaaaaaaaaaaaaannnnnnnnnnnnnnnnnnnn

单链表倒序 ，多个栈公用一块存储空间，以及迷宫问题的求解 -Single linked list in reverse order, more than a stack of public storage space, as well as solving a maze problem

ORACLE最大的逻辑组成部分。ORACLE数据库由一个或多个表空间组成，一个表空间由一个或多个数据文件组成，但一个数据文件只能属于一个表空间。数据库表等对象是存放在表空间中的。-ORACLE The largest component of the logic. ORACLE database by one or more table space for components, a table space by one or more data files, a data file can only belong to a table space. Database tables and other objects are stored in the table space.

运行环境必须在win9x环境下-operating environment must win9x environment