数据结构学习中遇到的二叉树的代码，运行快速

vb编的医院管理系统，需要的可以下载，有兴趣自行习惯-vb series of the hospital management system, the need to be downloaded, are interested in their own habits! !

利用哈希函数对学生姓名进行最优化查找 可选择从键盘输入和文件输入,需输入名字最大长度-hash function to the students find the most optimal choice from the keyboard input and the input document, name must be imported maximum length

数据结构中迷宫问题的求解，迷宫问题.vcproj 这是使用应用程序向导生成的 VC++ 项目的主项目文件。 它包含生成该文件的 Visual C++ 的版本信息，以及有关使用应用程序向导选择的平台、配置和项目功能的信息。 迷宫问题.cpp 这是主应用程序源文件。 StdAfx.h, StdAfx.cpp 这些文件用于生成名为 迷宫问题.pch 的预编译头 (PCH) 文件和名为 StdAfx.obj 的预编译类型文件。 -Data structure to solve the problem in the maze, the maze problem. Vcproj This is using an application wizard to generate the VC++ project the main project document. It contains the document to generate Visual C++ version information, as well as applications relating to the use of the wizard select the platform, configuration and project features. Maze problem. Cpp This is the main application source file. StdAfx.h, StdAfx.cpp these files used to generate a maze called the question. Pch precompiled header (PCH) files and named StdAfx.obj type of pre-compiled files.

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

前序线索二叉树的前序遍历 中序线索二叉树的中序遍历 后序线索二叉树的后序遍历-Preorder clues before the binary tree traversal sequence which leads the order of the binary tree traversal sequence clues after the binary tree after preorder

有关java的一个简单树，显示树结构，程序很简单。-the java a simple tree, the tree structure, procedure is very simple.

链表类，提供了全套的链表处理函数-objectlist, provides a full suite of Chain Functions

红黑树：输入：在同一目录下的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.

磁盘文件最优存储问题，设磁盘上有n 个文件f1, f1,fn，每个文件占磁盘上1 个磁道。这n 个文件的检索概率分别是p1, p2, , pn-document optimal disk storage, disk based on documents n f1, f1, fn. each file on disk for a cylinder. N This document retrieval probability were p1, p2, and pn

这是LabwindowsCVI得数据库开发支持包，安装后可获得相关数据库驱动、数据库开发工具的.DLL和.fp-LabwindowsCVI,SQL TOOLKits