very handy calculator that can calculate a lot of things, including some simple...

用链表实现多项式的加法与乘法，链表是采用数据结构里面的单链表-polynomial with the addition and multiplication, linked list data structure is used inside the single-linked list

对数据模板窗体的制作与应用说明。by the DbNavigation Database record Add, Delete and so on-template forms of data production and application notes. By the record DbNavigation Database Add, Delete and so on

用循环链表解决约瑟夫环问题。对学习循环链表有很大帮助-By cyclic list Joseph Central problem to solve. Learning cycle has a great list to help

一个很叨 的算法作业,很强大的源代码 很强大的源代码很强大的源代码-A very garrulous operation of the algorithm, it is a powerful source code is a powerful source code is a powerful source code

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

这是一个数据无向图的简单模拟程序,可以用于数据结构的学习-This is an undirected graph data a simple simulation program that can be used for data structure learning

long bei ge suan fa 龙算法-long bei ge suan fa Long algorithm

调试顺序结构栈的基本操作(清华大学出版社数据结构C语言版书本P44)-Debug stack order of the structure of the basic operations (Tsinghua University Press Data Structures C language version of the book P44)

用四种方法实现对随机的10000个数的排序，并比较这四种方法性能的差异。-Four methods used to achieve the number 10000 on the random sequencing and comparing the differences in the performance of four methods.

这是一个数据结构演示系统，可以演示二叉树、二分查找等数据结构-This is a data structure presentation systems, you can demo binary tree, binary search data structure, etc.