b tree how to operate on b tr

我们开发的系统实际上基于三个主要模块。 > 通过打印的所有输入/输出活动记录指纹机上 > 标记出勤 > 消息提醒系统，向每个签入或签出的学生家长。

用c++写一个售货员问题。这是高级算法中除了红黑树中最难的一个了。是研究生课程中的的程序实现-used to write a salesman problem. This is in addition to the High algorithm RED-BLACK TREE which one of the most difficult. The postgraduate courses in the program

在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。 给定作业序列，要求一种作业排序算法，使获得的总效益值最大。 -On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits. For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.

包含图的遍历和线性链表两个内容，压缩文件里含有设计报告-Contains the graph traversal and linear chain of two elements, compressed file contains the design report

VC + SQL数据库编程 人事、工资、部门管理 包含SQL备份文件及部分源码注释-VC+ SQL Database Programming personnel, wages, management SQL backup file contains the source code and some notes

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

矩阵常见算法，C++实现的类，这是个下载的公用类如果侵犯了您的权利，请告诉我。-This class implements some usual operation about matrix.If this pragram being put on the internet infringe upon your right,please tell me.

这是个操作系统的时间片转换代码 希望可以对大家有所帮补 ^_^-this is the operating system for time-code conversion hope you all have a right to help make ^ _ ^

多中通用排序算法组合源码，不好用你找我.-Sorting algorithm and more general source portfolio, not me with you.

本程序能读取系统环境变量,查看有无鼠标 .若有,便输出Mouse is OK, 反之便输出No mouse.