Bbd 示例软件访问

Thalmann算法的java实现。有详细注释。-Thalmann algorithm to achieve the java. Notes detail.

算法设计与分析实验报告，内容很全面的，呵呵。-algorithm design and analysis of experiments report, very comprehensive, huh.

ORACLE数据库的很好的PPT教程，希望对大家有所帮助-ORACLE database PPT excellent tutorial we want to help

简单的access应用程序-simple access applications

备份及取备份.zip-backup and take backup. Zip

Unix下Oracle数据库开发必备资料-Unix under the essential information on Oracle database development

BDijkstra算法的java实现。使用工具是eclipse，java1.4以上-BDijkstra algorithm to achieve the java. Eclipse is the use of tools, more java1.4

数据结构课程设计-curriculum design data structures!

共有4个数据结构的实例-a total of four examples of the data structure

数 据 结 构 大型 作业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