demonstration algorithm data structure

树的四种遍历方式，中叙，前序，后序和按层遍历算法，前三个用递归很好实现，最后一个复杂点。-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.

书籍管理系统，SQL数据库课程设计，用C实现与SQL数据库连接实现书籍增加删除查询等功能模块，采用分模块法，论文与代码齐全，-book management system, SQL database curriculum design, realization of C and SQL database connectivity to achieve books increased inquiries delete function module, a sub-module, papers and complete code,

一个小巧的论坛程序 本程序基本功能： 　可开设任意数目的讨论区类别和版块 使用Cookies，方便用户的使用 用户有自定义的设置 帖子分表功能，大大的加快论坛的速度 用户自定义样式 投票功能,论坛短信功能，帖子置顶和总置顶功能 上传附件功能 锁定功能,包括锁定帖子功能和锁定论坛功能 认证功能,认证特殊用户 会员版面,仅注册用户登陆后才可进入...... 更多贴身功能相信您在使用过程中会感受得到-a smaller forum procedures of this program basic functions : to be open to discuss any number of category and the use of Cookies plate, the use of user-friendly user-defined settings posted meters function, and thus accelerate the pace of the Forum user-defined functions voting patterns, the Forum messaging functions, message home total set-top roof and functional upload attachments lock function, including articles lock function and lock forum function authentication, user authentication special Member layout, only registered users to enter only after landing ...... more personal function you believe in the use of the process will s

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

直接插入算法Directly into the algorithm-Directly into the algorithm

数据结构的java实现-data structure to achieve the java

C语言数据结构课件及复习题和一些技术的讲解-C language data structures courseware and review questions and a number of technologies on

数据结构汉诺塔-data structure HANOR

这个程序时还没有powerdesigner,erwin的时候出现的，到现在也实用，需要fmt的一个格式文件来描述表结构，执行完毕形成xxx.sql语句，然后isql -Usa -P -Sservname -ixxx.sql即可-this procedure was no powerdesigner, erwin the time and it has practical need fmt format of a table to describe the structure, finished form xxx.sql statement, and then isql-Usa- P-Sservname-can ixxx.sql

数据库课程设计 附加源代码。学校学生成绩管理的一个系统。教师可以查看修改学生成绩。学生查看成绩。登陆模式区分身份验证。只需要导入到软件就可以使用