TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we co...

数据结构上机实验内容. 树形选择排序源程序代码,内容正确-data structure on the plane experiments. Tree Selection Sorting source code, the right content

基于VISUAL C++开发的运动会的评分系统，属于 数据结构-Based on the VISUAL C++ Games developed scoring system, which data structure

客户关系管理系统,可以进行一些简单的客户关系管理

浙江工业大学C++数据结构课程设计的练习作品 有一定的难度 有英文原题说明（老外授课）大家可以先看题自己做再参考我的程序-C data structure courses designed exercises works have a certain degree of difficulty that the original is in English (non teaching) that we can look at ourselves with reference to the procedures I

大学的每个专业都要编制教学计划。假设任何专业都有固定的学习年限，每学年含两学期，每学期的时间长度和学分上限都相等。每个专业开设的课程都是确定的，而且课程的开设时间的安排必须满足先修关系。每个课程的先修关系都是确定的，可以有任意多门，也可以没有。每一门课程恰好一个学期。试在这样的情况下设置一个教学计划编制程序。三、基本要求：（1）：输入参数：学期总数，一学期的学分上限，每门课的课程号，学分，直接先修关系的课程号。（2）：课程号尽可能的集中在前几个学期中。（3）：若无解，则报告错误信息；否则见教学计划输入到指定的文件中。计划的表格格式自行设计-University of each professional should prepare teaching plans. The assumption that any professional have fixed the length of each school year with two semesters each semester and the length of time equal to the credit limit are. Every professional courses are opened to determine, and the creation of curriculum time arrangements must meet pre relations. Each course is the pre-established relationship, can have any more doors, there will be no. Each course just one semester. Tests in the circumstances set up a teaching program procedures. Three basic requirements : (1) : input parameters : total semester, a semester"s credit ceiling for each class courses, credits, direct relationship prevocational courses,. (2) : N

一个人事信息的数据库管理的系统，很实用的，欢迎大家参考-A personnel information database management systems, it is practical to welcome U.S. reference

数据结构课程设计报告,算术表达式求值,自动辨别算符优先级,括号,将char型转换成int计算,再将结果显示,具有精美用户界面-data structure curriculum design, arithmetic expression evaluates automatically identify operator precedence, in brackets, char to int conversion type, the result shows that the user interface is attractive

包罗各种算法，相当全面，可以下载看看，具体有单元加、求进制、汉诺塔、底层编程、小写数字转为大写数字、数据结构、算法基础等等。-Cover a variety of algorithms, is very comprehensive and can be downloaded to see the specific unit plus, and band, Tower of Hanoi, the underlying programming, lower case to upper case the number of figures, data structures, algorithms, etc. basis.

数据结构表达式求值-data structure expression evaluates

树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-tree traversal of the four, China and Syria, the former sequence after sequence and by layer traversal algorithm, the former three Recursive properly achieved, Finally a complex point.