OTL4示例

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

一款用C#编写的精简ERP系统，帮你了解ERP系统和C#开发的方法

将内存中的一段数据拷贝到另外一段内存中，要考虑其中的内存覆盖问题。-A section of the memory to copy data to another section of memory, it is necessary to take into account the memory coverage problems.

求最近点对问题， 求最近点对问题。-Nearest point on the issue of demand, and the nearest point on the issue, and the nearest point on the issue.

程序　请认真书写上传资料的详细功能、包含内容说明-ccbvcxb

数据结构上机实习关于多项式的源程序！是我同学编的！-data structure for the attachment of polynomial source! Part of my classmates!

算法类，二进制加法的源代码，算法导论上的-Algorithm-type, binary adder

数据结构中的AVL TREE的实现-data structure of the realization of AVL TREE

实现m阶B_树 （2）将线性表中的键值插入到B_树中（即建立索引）； （3）当删除和插入数据到线性表时，同时维护其索引B_树。 （4）可根据所给键值范围，输出该范围的所有键值-achieve m bands Containing tree (2) linear scale for the keys inserted into Containing tree (index); (3) When the deletion and insertion of data to the linear scale, while preserving its index Containing tree. (4) According to the pair, the scope of the output of all keys

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