C语言，数据结构。通过二分法求解方程的根值

Realiza inventarios no terminado

这是车辆管理系统的 PHP 源代码。欢迎下载，试用。谢谢大家的支持 ！希望能有帮助！

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

在顺序存储结构上,采用顺序查找算法，直接插入排序算法等算法查找一关键字,输出查找结果-In the sequential storage structure, using the sequential search algorithm, sorting algorithm directly into the search for a keyword such as algorithms, the output search results

数据结构的课程设计---稀疏矩阵运算器 希望可以给大家参考-data structure design of the curriculum-- for sparse matrix operations can hope for your reference

fifo和lru页面置换算法-fifo and LRU algorithm replacement pages

huffman编码-huffman coding

最短路径的具体实现，使用了dikstra算法-Concrete realization of the shortest path, using the algorithm dikstra

数据库实验，建立一个简单的数据库，有打开、存储、删除、建立等值嵌套循环连接的功能。-database experiments, a simple database, open storage, delete, equivalent to establish nested loop join function.

关于dss系统，即提供pmis系统和做erp系统。