sql数据库电子书

平衡二叉树实现一个动态查找表,有三种基本功能:查找,插入删除,还有选项功能:合并两棵平衡二叉树,和分裂两棵平衡二叉树.-balanced binary tree to achieve a dynamic lookup table, there are three basic functions : to find, delete, insert, functional options : merging two balanced binary tree, and split two balanced binary tree.

db2建库代码和开发文档 帮助初学者更好的学习db2-db2 database code and the development of documentation to help beginners better learning db2

跟着鼠标转的眼睛控-with eyes turned to the mouse control

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

北大ACM1969（Count on Canton） -North ACM1969 (Count on Canton)

c++下的AOV实现-c achieve the AOV

这是一个物资管理系统，有些错误，还请大家更正！-This is a materials management system, some errors, but also please correct!

典型的迷宫算法，用数据结构――栈来实现，很好的代码-maze

在有向图中计算最小生成树---Edmonds s Algorithm-Directed graph in calculating minimum spanning tree--- Edmonds s Algorithm

如何以编程方式将数据从ACCESS数据库导出到EXCEL